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 15, 2026 20:01Victor MerckléVictor MerckléScore: 73,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 20:0173,143615,355,190603,655,0003,438,0002,121,728stderr
2May 15, 2026 20:0173,143614,627,487603,713,0003,382,0002,121,728stderr
3May 15, 2026 20:0173,217615,677,090604,315,0003,392,0002,121,728stderr
4May 15, 2026 20:0173,365616,220,404605,697,0003,235,0002,121,728stderr
5May 15, 2026 20:0173,390619,791,818605,979,0003,166,0002,121,728stderr
6May 15, 2026 20:0173,859621,594,979609,393,0003,638,0002,121,728stderr
7May 15, 2026 20:0174,063624,695,755611,413,0003,318,0002,121,728stderr
8May 15, 2026 20:0174,264625,226,870612,776,0003,616,0002,121,728stderr
9May 15, 2026 20:0174,371627,406,595613,940,0003,347,0002,121,728stderr