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 10:19Victor MerckléVictor MerckléScore: 6,979Success
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 10:206,97467,180,88756,890,0001,002,0002,113,536
2May 15, 2026 10:206,97566,945,90857,899,00002,113,536
3May 15, 2026 10:206,97668,081,85657,904,00002,113,536
4May 15, 2026 10:206,97765,185,09556,874,0001,037,0002,113,536
5May 15, 2026 10:206,97967,159,00457,926,00002,113,536
6May 15, 2026 10:206,98067,611,07156,901,0001,037,0002,113,536
7May 15, 2026 10:206,98166,141,27556,932,0001,015,0002,113,536
8May 15, 2026 10:207,03468,405,72957,348,0001,039,0002,113,536
9May 15, 2026 10:207,10366,215,45957,928,0001,030,0002,113,536