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 28, 2026 19:03Victor MerckléVictor MerckléScore: 3,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:043,70038,910,38329,534,0001,182,0002,117,632stderr
2Aug 28, 2026 19:043,70638,987,95529,674,0001,089,0002,117,632stderr
3Aug 28, 2026 19:043,71238,955,97929,726,0001,085,0002,117,632stderr
4Aug 28, 2026 19:043,71839,164,79429,760,0001,104,0002,117,632stderr
5Aug 28, 2026 19:043,72440,398,49629,820,0001,091,0002,117,632stderr
6Aug 28, 2026 19:043,74340,187,00529,893,0001,175,0002,117,632stderr
7Aug 28, 2026 19:043,80339,738,41730,393,0001,173,0002,117,632stderr
8Aug 28, 2026 19:043,81140,605,90430,488,0001,145,0002,117,632stderr
9Aug 28, 2026 19:043,94042,584,39231,521,0001,189,0002,117,632stderr