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 11:40Victor MerckléVictor MerckléScore: 3,805Success
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 11:403,70339,137,16729,641,0001,098,0002,117,632stderr
2Aug 25, 2026 11:403,72639,321,45529,825,0001,109,0002,117,632stderr
3Aug 25, 2026 11:403,73440,079,10629,830,0001,165,0002,117,632stderr
4Aug 25, 2026 11:403,75240,179,21229,982,0001,167,0002,117,632stderr
5Aug 25, 2026 11:403,80539,895,53630,503,0001,079,0002,117,632stderr
6Aug 25, 2026 11:403,81240,034,52930,517,0001,128,0002,117,632stderr
7Aug 25, 2026 11:403,81440,019,81830,603,0001,058,0002,117,632stderr
8Aug 25, 2026 11:403,82840,128,71130,697,0001,077,0002,117,632stderr
9Aug 25, 2026 11:403,86340,450,63030,927,0001,140,0002,117,632stderr