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 25, 2026 10:46Victor MerckléVictor MerckléScore: 3,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 10:473,88340,609,17231,086,0001,144,0002,117,632stderr
2Aug 25, 2026 10:473,89942,623,41231,205,0001,163,0002,117,632stderr
3Aug 25, 2026 10:473,91440,838,52631,370,0001,118,0002,117,632stderr
4Aug 25, 2026 10:473,91840,876,88131,468,0001,055,0002,117,632stderr
5Aug 25, 2026 10:473,92240,873,29831,505,0001,048,0002,117,632stderr
6Aug 25, 2026 10:473,92640,953,71331,447,0001,141,0002,117,632stderr
7Aug 25, 2026 10:473,93741,079,14931,567,0001,111,0002,117,632stderr
8Aug 25, 2026 10:473,94441,084,87031,575,0001,162,0002,117,632stderr
9Aug 25, 2026 10:473,97841,349,49731,906,0001,113,0002,117,632stderr