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 listMay 11, 2026 13:49Victor MerckléVictor MerckléScore: 11,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 13:4911,323102,833,28892,960,0001,028,0002,146,304
2May 11, 2026 13:4911,324102,943,79792,798,0001,196,0002,146,304
3May 11, 2026 13:4911,325104,096,37092,792,0001,208,0002,138,112
4May 11, 2026 13:4911,330103,939,76193,006,0001,035,0002,146,304
5May 11, 2026 13:4911,331103,642,48893,021,0001,029,0002,138,112
6May 11, 2026 13:4911,332103,923,23993,023,0001,034,0002,138,112
7May 11, 2026 13:4911,332104,263,42193,018,0001,039,0002,146,304
8May 11, 2026 13:4911,339105,532,52992,985,0001,133,0002,146,304
9May 11, 2026 13:4911,343103,878,06592,936,0001,218,0002,146,304