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 24, 2026 19:49Victor MerckléVictor MerckléScore: 23,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 19:5123,736204,811,159195,952,0001,065,0002,113,536
2May 24, 2026 19:5123,740204,841,554196,011,0001,035,0002,113,536
3May 24, 2026 19:5123,818205,547,785196,661,0001,031,0002,113,536
4May 24, 2026 19:5123,859207,758,318196,953,0001,079,0002,113,536
5May 24, 2026 19:5123,912212,919,365196,419,0002,058,0002,113,536
6May 24, 2026 19:5124,060208,534,390198,669,0001,035,0002,113,536
7May 24, 2026 19:5124,103212,011,638199,048,0001,014,0002,113,536
8May 24, 2026 19:5124,236209,454,259200,109,0001,058,0002,113,536
9May 24, 2026 19:5124,344211,370,331198,034,0004,023,0002,113,536