Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJan 30, 2025 01:01PolycarbohydratePolycarbohydrateScore: 390,266Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2025 01:01387,0833,240,016,2443,158,791,00053,996,0002,281,472
2Jan 30, 2025 01:01389,1203,255,377,4613,165,744,00063,954,0002,473,984
3Jan 30, 2025 01:01389,5373,260,796,5673,172,188,00060,965,0002,367,488
4Jan 30, 2025 01:01390,2413,265,321,2773,162,051,00076,952,0002,363,392
5Jan 30, 2025 01:01390,2663,269,678,1083,163,248,00075,957,0002,359,296
6Jan 30, 2025 01:01390,2703,268,890,0563,176,274,00062,965,0002,289,664
7Jan 30, 2025 01:01390,6853,269,396,5343,177,715,00064,973,0002,363,392
8Jan 30, 2025 01:01391,3463,272,031,9713,176,216,00071,959,0002,289,664
9Jan 30, 2025 01:01397,9383,330,705,3573,239,928,00062,959,0002,285,568