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 7, 2026 10:11wnwnScore: 3,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:123,39143,700,46827,093,0001,053,0002,482,176
2May 7, 2026 10:123,39644,574,99427,096,0001,097,0002,486,272
3May 7, 2026 10:123,40343,101,66527,189,0001,061,0002,482,176
4May 7, 2026 10:123,43744,712,14827,413,0001,120,0002,490,368
5May 7, 2026 10:123,51445,735,75828,091,0001,080,0002,494,464
6May 7, 2026 10:123,54443,070,01328,337,0001,080,0002,478,080
7May 7, 2026 10:123,58143,715,62128,650,0001,079,0002,486,272
8May 7, 2026 10:123,59046,703,72428,710,0001,093,0002,478,080
9May 7, 2026 10:123,59745,786,99228,746,0001,110,0002,494,464