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 listMar 13, 2026 14:19caandocaandoScore: 4,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 14:194,53365,071,27936,610,0001,016,0002,478,080
2Mar 13, 2026 14:194,56167,641,32235,866,0001,992,0002,478,080
3Mar 13, 2026 14:194,56560,988,34536,894,000997,0002,478,080
4Mar 13, 2026 14:194,57263,509,99435,954,0001,997,0002,285,568
5Mar 13, 2026 14:194,58763,794,47936,068,0002,003,0002,486,272
6Mar 13, 2026 14:194,58757,751,60535,068,0003,005,0002,285,568
7Mar 13, 2026 14:194,59865,209,61136,158,0002,008,0002,486,272
8Mar 13, 2026 14:194,60271,105,04635,185,0003,015,0002,285,568
9Mar 13, 2026 14:194,62160,241,51335,326,0003,027,0002,285,568