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 23:37Victor MerckléVictor MerckléScore: 6,952Success
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 23:376,94967,005,21956,672,0001,011,0002,113,536
2May 15, 2026 23:376,95067,883,38356,676,0001,012,0002,113,536
3May 15, 2026 23:376,95166,068,95357,696,00002,113,536
4May 15, 2026 23:376,95267,281,47957,708,00002,113,536
5May 15, 2026 23:376,95265,914,22456,689,0001,013,0002,113,536
6May 15, 2026 23:376,95566,516,71956,720,0001,007,0002,113,536
7May 15, 2026 23:376,95666,840,09856,737,0001,005,0002,113,536
8May 15, 2026 23:376,95768,231,05056,738,0001,007,0002,113,536
9May 15, 2026 23:377,00665,753,77658,158,00002,113,536