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 13:46Josu San MartinJosu San MartinScore: 4,204Success
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 13:474,19542,155,69933,781,0001,042,0002,113,536
2May 10, 2026 13:474,19542,033,03633,791,0001,034,0002,113,536
3May 10, 2026 13:474,19643,096,98633,803,0001,032,0002,113,536
4May 10, 2026 13:474,19942,098,79833,822,0001,037,0002,113,536
5May 10, 2026 13:474,20443,308,33833,847,0001,048,0002,113,536
6May 10, 2026 13:474,21242,825,29033,917,0001,050,0002,113,536
7May 10, 2026 13:474,21944,483,85333,988,0001,034,0002,113,536
8May 10, 2026 13:474,22144,459,44834,002,0001,038,0002,113,536
9May 10, 2026 13:474,31843,945,95334,806,0001,041,0002,113,536