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 listJul 9, 2026 15:22Victor MerckléVictor MerckléScore: 35,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 15:2335,264300,830,110291,677,0001,015,0002,117,632stderr
2Jul 9, 2026 15:2335,290301,046,715291,792,0001,119,0002,117,632stderr
3Jul 9, 2026 15:2335,308301,270,391292,056,0001,001,0002,117,632stderr
4Jul 9, 2026 15:2335,310301,166,758291,939,0001,137,0002,117,632stderr
5Jul 9, 2026 15:2335,415302,100,298292,893,0001,058,0002,117,632stderr
6Jul 9, 2026 15:2335,497302,767,027293,575,0001,053,0002,117,632stderr
7Jul 9, 2026 15:2335,563303,362,213294,161,0001,018,0002,117,632stderr
8Jul 9, 2026 15:2335,588303,545,448294,245,0001,137,0002,117,632stderr
9Jul 9, 2026 15:2336,542311,344,167302,196,0001,110,0002,117,632stderr