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 8, 2026 18:47Victor MerckléVictor MerckléScore: 3,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 18:503,61238,292,62828,917,0001,067,0002,117,632stderr
2Sep 8, 2026 18:503,61339,225,33328,863,0001,127,0002,117,632stderr
3Sep 8, 2026 18:503,61638,339,14228,923,0001,091,0002,117,632stderr
4Sep 8, 2026 18:503,61938,465,07428,957,0001,085,0002,117,632stderr
5Sep 8, 2026 18:503,62139,366,81828,975,0001,086,0002,117,632stderr
6Sep 8, 2026 18:503,62539,338,36228,981,0001,111,0002,117,632stderr
7Sep 8, 2026 18:503,63038,489,27229,044,0001,091,0002,117,632stderr
8Sep 8, 2026 18:503,64138,638,13529,136,0001,088,0002,117,632stderr
9Sep 8, 2026 18:503,64839,622,96829,181,0001,104,0002,117,632stderr