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 listSep 6, 2026 16:03Kevin HeaveyKevin HeaveyScore: 3,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 16:063,65938,818,87329,237,0001,135,0002,113,536
2Sep 6, 2026 16:063,68038,876,43229,379,0001,166,0002,113,536
3Sep 6, 2026 16:063,68238,981,29229,516,0001,046,0002,113,536
4Sep 6, 2026 16:063,74939,517,26429,943,0001,177,0002,113,536
5Sep 6, 2026 16:063,81842,320,38430,540,0001,154,0002,113,536
6Sep 6, 2026 16:063,82639,978,53330,600,0001,156,0002,113,536
7Sep 6, 2026 16:063,84140,353,02630,730,0001,158,0002,113,536
8Sep 6, 2026 16:063,84941,660,59730,782,0001,165,0002,113,536
9Sep 6, 2026 16:063,84940,661,99530,790,0001,161,0002,113,536