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 12:30Victor MerckléVictor MerckléScore: 6,968Success
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 12:306,96265,137,75957,785,00002,113,536
2May 15, 2026 12:306,96465,095,11057,802,00002,113,536
3May 15, 2026 12:306,96468,122,94556,802,0001,002,0002,113,536
4May 15, 2026 12:306,96666,976,48657,826,00002,113,536
5May 15, 2026 12:306,96867,851,98557,839,00002,113,536
6May 15, 2026 12:306,97266,391,15156,874,0001,000,0002,113,536
7May 15, 2026 12:306,98065,956,19756,903,0001,037,0002,113,536
8May 15, 2026 12:306,98566,322,29657,977,00002,113,536
9May 15, 2026 12:307,01067,554,40557,142,0001,044,0002,113,536