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 11:00wnwnScore: 3,396Success
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 11:013,37542,926,77226,959,0001,059,0002,486,272
2May 7, 2026 11:013,37741,441,68626,960,0001,071,0002,490,368
3May 7, 2026 11:013,38241,813,32926,985,0001,087,0002,490,368
4May 7, 2026 11:013,39344,620,91627,108,0001,056,0002,482,176
5May 7, 2026 11:013,39645,389,44427,093,0001,099,0002,478,080
6May 7, 2026 11:013,40142,737,13827,158,0001,077,0002,486,272
7May 7, 2026 11:013,41944,745,97327,251,0001,133,0002,486,272
8May 7, 2026 11:013,46444,961,56127,686,0001,070,0002,490,368
9May 7, 2026 11:013,49244,029,44527,879,0001,108,0002,486,272