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:44wnwnScore: 3,404Success
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:453,38042,210,36927,008,0001,053,0002,490,368
2May 7, 2026 10:453,38240,732,13426,988,0001,087,0002,482,176
3May 7, 2026 10:453,38845,463,24727,047,0001,081,0002,482,176
4May 7, 2026 10:453,40344,635,91127,159,0001,092,0002,490,368
5May 7, 2026 10:453,40443,898,25627,160,0001,094,0002,486,272
6May 7, 2026 10:453,40444,514,87927,184,0001,070,0002,486,272
7May 7, 2026 10:453,42143,137,78227,304,0001,093,0002,478,080
8May 7, 2026 10:453,55546,550,05528,420,0001,088,0002,482,176
9May 7, 2026 10:453,58345,509,56828,660,0001,079,0002,486,272