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 16, 2026 05:45Victor MerckléVictor MerckléScore: 6,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 05:466,95266,705,14257,703,00002,113,536
2May 16, 2026 05:466,95366,836,99456,706,0001,009,0002,113,536
3May 16, 2026 05:466,95567,381,92057,731,00002,113,536
4May 16, 2026 05:466,95767,420,04356,728,0001,023,0002,113,536
5May 16, 2026 05:466,96166,882,58856,753,0001,026,0002,113,536
6May 16, 2026 05:466,96267,675,44056,769,0001,018,0002,113,536
7May 16, 2026 05:466,96468,026,53656,791,0001,017,0002,113,536
8May 16, 2026 05:467,01567,427,95557,211,0001,018,0002,113,536
9May 16, 2026 05:467,13466,515,23859,217,00002,113,536