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 10:35Victor MerckléVictor MerckléScore: 4,212Success
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 10:384,09442,495,11829,382,0004,599,0002,117,632stderr
2Sep 8, 2026 10:384,18143,229,03830,360,0004,348,00024,576stderr
3Sep 8, 2026 10:384,18743,853,30130,226,0004,530,00024,576stderr
4Sep 8, 2026 10:384,19343,950,19630,231,0004,575,0002,117,632stderr
5Sep 8, 2026 10:384,21244,026,54129,969,0004,992,00024,576stderr
6Sep 8, 2026 10:384,22844,319,66430,416,0004,682,0002,117,632stderr
7Sep 8, 2026 10:384,29844,075,50830,189,0005,491,00024,576stderr
8Sep 8, 2026 10:384,32545,769,54229,816,0006,089,00024,576stderr
9Sep 8, 2026 10:384,40545,759,12229,839,0006,724,00024,576stderr