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 00:58Victor MerckléVictor MerckléScore: 5,077Success
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 00:594,94049,187,72639,965,0001,045,0002,117,632stderr
2Aug 25, 2026 00:595,05550,392,09040,866,0001,094,0002,117,632stderr
3Aug 25, 2026 00:595,07250,222,03741,059,0001,046,0002,117,632stderr
4Aug 25, 2026 00:595,07450,289,23641,061,0001,054,0002,117,632stderr
5Aug 25, 2026 00:595,07750,590,47941,084,0001,058,0002,117,632stderr
6Aug 25, 2026 00:595,08350,520,66441,136,0001,060,0002,117,632stderr
7Aug 25, 2026 00:595,09150,445,22941,159,0001,101,0002,117,632stderr
8Aug 25, 2026 00:595,13550,765,72041,578,0001,046,0002,117,632stderr
9Aug 25, 2026 00:595,16851,438,67741,796,0001,100,0002,117,632stderr