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 13, 2026 02:39Victor MerckléVictor MerckléScore: 9,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 02:399,32285,522,71977,376,00002,113,536
2May 13, 2026 02:399,32486,304,79677,393,00002,113,536
3May 13, 2026 02:399,32786,927,53576,376,0001,041,0002,113,536
4May 13, 2026 02:399,32786,328,81576,420,0001,002,0002,113,536
5May 13, 2026 02:399,32786,441,52176,377,0001,044,0002,113,536
6May 13, 2026 02:399,33384,877,78376,466,0001,003,0002,113,536
7May 13, 2026 02:399,33385,018,04376,463,0001,006,0002,113,536
8May 13, 2026 02:399,33384,936,08376,456,0001,008,0002,113,536
9May 13, 2026 02:399,33487,293,44176,471,0001,008,0002,113,536