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 10, 2026 18:15Josu San MartinJosu San MartinScore: 4,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 18:154,10441,478,58533,013,0001,057,0002,113,536
2May 10, 2026 18:154,10642,855,37033,030,0001,052,0002,113,536
3May 10, 2026 18:154,11041,811,25033,055,0001,065,0002,113,536
4May 10, 2026 18:154,11042,006,80533,046,0001,068,0002,113,536
5May 10, 2026 18:154,12042,688,88833,140,0001,059,0002,113,536
6May 10, 2026 18:154,12541,555,50033,204,0001,040,0002,113,536
7May 10, 2026 18:154,13242,784,18833,241,0001,058,0002,113,536
8May 10, 2026 18:154,14541,795,89733,349,0001,056,0002,113,536
9May 10, 2026 18:154,20742,545,16033,866,0001,053,0002,113,536