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 28, 2026 05:34Victor MerckléVictor MerckléScore: 5,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 05:355,46953,720,29144,254,0001,142,0002,113,536
2Aug 28, 2026 05:355,47153,626,90244,310,0001,107,0002,113,536
3Aug 28, 2026 05:355,48053,797,40544,437,0001,048,0002,113,536
4Aug 28, 2026 05:355,48353,703,28444,482,0001,029,0002,113,536
5Aug 28, 2026 05:355,60854,904,32445,490,0001,058,0002,113,536
6Aug 28, 2026 05:355,61554,858,56645,552,0001,060,0002,113,536
7Aug 28, 2026 05:355,72055,990,97646,295,0001,189,0002,113,536
8Aug 28, 2026 05:355,74656,027,38846,652,0001,041,0002,113,536
9Aug 28, 2026 05:355,76256,211,95246,788,0001,044,0002,113,536