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 14, 2026 06:34Victor MerckléVictor MerckléScore: 6,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 06:346,97565,197,96956,887,0001,013,0002,113,536
2May 14, 2026 06:346,97667,748,62156,904,0001,003,0002,113,536
3May 14, 2026 06:346,97867,556,45056,903,0001,019,0002,113,536
4May 14, 2026 06:346,98266,584,09157,957,00002,113,536
5May 14, 2026 06:346,98268,344,91957,956,00002,113,536
6May 14, 2026 06:346,98265,370,13157,954,00002,113,536
7May 14, 2026 06:346,98366,040,28457,959,00002,113,536
8May 14, 2026 06:347,02767,784,79457,325,0001,005,0002,113,536
9May 14, 2026 06:347,08168,176,46457,774,0001,003,0002,113,536