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 12, 2026 22:40Victor MerckléVictor MerckléScore: 3,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 22:413,79239,948,34630,341,0001,136,0002,117,632stderr
2Aug 12, 2026 22:413,82940,226,32830,703,0001,081,0002,117,632stderr
3Aug 12, 2026 22:413,82940,156,10330,665,0001,117,0002,117,632stderr
4Aug 12, 2026 22:413,83240,202,62430,677,0001,132,0002,117,632stderr
5Aug 12, 2026 22:413,85940,482,59830,868,0001,165,0002,117,632stderr
6Aug 12, 2026 22:413,89040,737,84131,200,0001,094,0002,117,632stderr
7Aug 12, 2026 22:413,93041,110,91631,535,0001,089,0002,117,632stderr
8Aug 12, 2026 22:413,96041,270,94331,814,0001,058,0002,117,632stderr
9Aug 12, 2026 22:414,08242,278,14632,828,0001,057,0002,117,632stderr