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 01:02Victor MerckléVictor MerckléScore: 4,017Success
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 01:033,96041,255,65631,751,0001,117,0002,117,632stderr
2Aug 25, 2026 01:033,98741,460,73931,988,0001,105,0002,117,632stderr
3Aug 25, 2026 01:034,00041,590,00631,933,0001,272,0002,117,632stderr
4Aug 25, 2026 01:034,00641,620,12132,144,0001,109,0002,117,632stderr
5Aug 25, 2026 01:034,01741,724,02032,210,0001,132,0002,117,632stderr
6Aug 25, 2026 01:034,03941,881,15632,401,0001,127,0002,117,632stderr
7Aug 25, 2026 01:034,07451,001,91232,692,0001,123,0002,117,632stderr
8Aug 25, 2026 01:034,08942,326,15532,832,0001,110,0002,117,632stderr
9Aug 25, 2026 01:034,23443,523,80934,090,0001,059,0002,117,632stderr