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 listApr 19, 2026 07:59wnwnScore: 3,727Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 08:013,71354,428,29028,828,0001,988,0002,494,464
2Apr 19, 2026 08:013,71557,233,16928,842,0001,989,0002,494,464
3Apr 19, 2026 07:593,71657,470,44328,855,0001,990,0002,486,272
4Apr 19, 2026 07:583,71960,653,13528,873,0001,991,0002,494,464
5Apr 19, 2026 07:583,72555,616,03728,927,0001,994,0002,277,376
6Apr 19, 2026 07:583,72655,601,38128,932,0001,995,0002,535,424
7Apr 19, 2026 08:013,72756,638,12828,936,0001,995,0002,277,376
8Apr 19, 2026 08:013,72858,460,17028,946,0001,996,0002,277,376
9Apr 19, 2026 08:013,73252,071,82728,975,0001,998,0002,277,376
10Apr 19, 2026 08:013,73658,675,93129,011,0002,000,0002,498,560
11Apr 19, 2026 07:593,73951,549,34029,035,0002,002,0002,486,272
12Apr 19, 2026 07:593,74050,952,38429,039,0002,002,0002,494,464