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 listAug 10, 2026 08:31Victor MerckléVictor MerckléScore: 4,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 08:334,07342,218,89932,690,0001,122,0002,117,632stderr
2Aug 10, 2026 08:334,07642,266,91332,712,0001,122,0002,117,632stderr
3Aug 10, 2026 08:334,08542,347,38332,902,0001,010,0002,117,632stderr
4Aug 10, 2026 08:334,08742,332,52232,810,0001,117,0002,117,632stderr
5Aug 10, 2026 08:334,09742,399,62532,897,0001,112,0002,117,632stderr
6Aug 10, 2026 08:334,10642,475,53732,961,0001,119,0002,117,632stderr
7Aug 10, 2026 08:334,11242,560,81633,013,0001,124,0002,117,632stderr
8Aug 10, 2026 08:334,11442,554,40233,111,0001,039,0002,117,632stderr
9Aug 10, 2026 08:334,12543,815,95933,236,0001,007,0002,117,632stderr