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 16, 2026 15:41Victor MerckléVictor MerckléScore: 3,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 15:453,66940,261,54329,307,0001,146,0002,117,632stderr
2Sep 16, 2026 15:453,67840,384,64329,393,0001,140,0002,117,632stderr
3Sep 16, 2026 15:453,68740,447,70329,464,0001,143,0002,117,632stderr
4Sep 16, 2026 15:453,70641,527,18229,628,0001,134,0002,117,632stderr
5Sep 16, 2026 15:453,71240,665,46629,699,0001,115,0002,117,632stderr
6Sep 16, 2026 15:453,72840,828,36229,926,0001,017,0002,117,632stderr
7Sep 16, 2026 15:453,74941,702,26130,006,0001,118,0002,117,632stderr
8Sep 16, 2026 15:453,75142,532,60229,997,0001,138,0002,117,632stderr
9Sep 16, 2026 15:453,76141,665,59530,088,0001,132,0002,117,632stderr