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 17, 2026 03:32M-RochatM-RochatScore: 12,742Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 03:3312,665114,093,201102,983,0002,144,0002,113,536
2May 17, 2026 03:3312,724114,969,294102,478,0003,138,0002,113,536
3May 17, 2026 03:3312,736115,700,112102,506,0003,206,0002,113,536
4May 17, 2026 03:3312,741114,533,576102,578,0003,173,0002,113,536
5May 17, 2026 03:3312,742116,424,754102,578,0003,187,0002,113,536
6May 17, 2026 03:3312,744114,564,551103,622,0002,158,0002,113,536
7May 17, 2026 03:3312,754114,690,728102,606,0003,256,0002,113,536
8May 17, 2026 03:3312,761117,145,647102,732,0003,186,0002,113,536
9May 17, 2026 03:3312,778115,600,709102,875,0003,183,0002,113,536