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 22:21Victor MerckléVictor MerckléScore: 6,981Success
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 22:216,97665,195,27957,908,00002,113,536
2May 15, 2026 22:216,97867,784,92656,911,0001,011,0002,113,536
3May 15, 2026 22:216,97865,227,35657,922,00002,113,536
4May 15, 2026 22:216,98066,706,63256,922,0001,012,0002,113,536
5May 15, 2026 22:216,98167,658,00857,943,00002,113,536
6May 15, 2026 22:216,98267,457,75256,933,0001,020,0002,113,536
7May 15, 2026 22:216,98467,515,29456,930,0001,043,0002,113,536
8May 15, 2026 22:217,01066,349,65657,174,0001,009,0002,113,536
9May 15, 2026 22:217,03566,101,48557,385,0001,012,0002,113,536