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 11:58Victor MerckléVictor MerckléScore: 4,544Success
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 12:014,49045,866,03431,641,0005,632,00024,576stderr
2Sep 8, 2026 12:014,52046,034,63232,235,0005,282,00024,576stderr
3Sep 8, 2026 12:014,52446,731,68032,125,0005,432,0002,117,632stderr
4Sep 8, 2026 12:014,53246,139,62332,148,0005,471,0002,117,632stderr
5Sep 8, 2026 12:014,54446,186,35732,463,0005,254,0002,117,632stderr
6Sep 8, 2026 12:014,54946,192,27731,779,0005,978,0002,117,632stderr
7Sep 8, 2026 12:014,56546,375,83432,392,0005,501,0002,117,632stderr
8Sep 8, 2026 12:014,60847,413,72432,421,0005,826,0002,117,632stderr
9Sep 8, 2026 12:014,63547,371,15332,552,0005,926,0002,117,632stderr