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 25, 2026 20:33Maya RebholzMaya RebholzScore: 5,969Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 20:335,88559,809,83943,591,0005,255,0002,117,632
2May 25, 2026 20:335,89561,484,81943,662,0005,273,0002,117,632
3May 25, 2026 20:335,91261,877,24443,560,0005,514,0002,117,632
4May 25, 2026 20:335,94459,968,21543,968,0005,373,0002,113,536
5May 25, 2026 20:335,96961,877,57944,082,0005,461,0002,117,632
6May 25, 2026 20:335,98360,923,73944,001,0005,664,0002,113,536
7May 25, 2026 20:336,00862,264,71744,290,0005,577,0002,113,536
8May 25, 2026 20:336,19060,811,90145,881,0005,503,0002,113,536
9May 25, 2026 20:336,26763,809,30846,427,0005,592,0002,117,632