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 listMay 14, 2026 09:16Victor MerckléVictor MerckléScore: 59,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 09:1759,269501,361,436490,939,0001,001,0002,117,632stderr
2May 14, 2026 09:1759,274499,305,227490,979,0001,002,0002,117,632stderr
3May 14, 2026 09:1759,281501,190,663491,032,0001,003,0002,117,632stderr
4May 14, 2026 09:1759,282500,100,653491,044,0001,003,0002,117,632stderr
5May 14, 2026 09:1759,283499,453,058491,053,0001,002,0002,117,632stderr
6May 14, 2026 09:1759,283499,541,755491,049,0001,002,0002,117,632stderr
7May 14, 2026 09:1759,284499,434,423491,056,0001,002,0002,117,632stderr
8May 14, 2026 09:1759,292499,387,264491,130,0001,001,0002,117,632stderr
9May 14, 2026 09:1759,296502,409,561491,154,0001,003,0002,117,632stderr