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 10, 2026 11:01Josu San MartinJosu San MartinScore: 4,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 11:014,06751,885,92532,633,0001,127,0002,482,176
2May 10, 2026 11:014,06752,225,58532,728,0001,031,0002,482,176
3May 10, 2026 11:014,07250,608,44032,666,0001,135,0002,490,368
4May 10, 2026 11:014,07750,849,86132,719,0001,123,0002,490,368
5May 10, 2026 11:014,08051,421,61132,740,0001,124,0002,482,176
6May 10, 2026 11:014,08549,232,26032,876,0001,037,0002,490,368
7May 10, 2026 11:014,10749,531,29732,944,0001,149,0002,486,272
8May 10, 2026 11:014,23653,366,93034,052,0001,110,0002,486,272
9May 10, 2026 11:014,39555,102,64035,369,0001,111,0002,494,464