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 listJun 26, 2026 18:35Josu San MartinJosu San MartinScore: 4,066Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 18:354,03741,227,47432,374,0001,136,0002,113,536
2Jun 26, 2026 18:354,04841,776,73032,454,0001,146,0002,113,536
3Jun 26, 2026 18:354,04941,287,32932,548,0001,061,0002,113,536
4Jun 26, 2026 18:354,06541,874,98132,732,0001,009,0002,113,536
5Jun 26, 2026 18:354,06641,629,09732,576,0001,175,0002,113,536
6Jun 26, 2026 18:354,07141,469,24132,636,0001,154,0002,113,536
7Jun 26, 2026 18:354,07441,403,77732,662,0001,158,0002,113,536
8Jun 26, 2026 18:354,08141,595,03232,745,0001,131,0002,113,536
9Jun 26, 2026 18:354,09241,746,61532,964,0001,006,0002,113,536