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 21, 2026 10:26Victor MerckléVictor MerckléScore: 4,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 10:274,68646,742,36537,859,0001,043,0002,113,536
2May 21, 2026 10:274,68646,851,72137,828,0001,072,0002,113,536
3May 21, 2026 10:274,68948,236,30137,870,0001,055,0002,113,536
4May 21, 2026 10:274,69646,808,30437,944,0001,038,0002,113,536
5May 21, 2026 10:274,70547,878,76038,051,0001,006,0002,113,536
6May 21, 2026 10:274,71646,987,09338,097,0001,051,0002,113,536
7May 21, 2026 10:274,81048,316,97938,858,0001,066,0002,113,536
8May 21, 2026 10:274,82247,916,26239,016,0001,007,0002,113,536
9May 21, 2026 10:274,96149,116,78040,174,0001,004,0002,113,536