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 08:35wnwnScore: 3,558Success
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 08:363,37946,159,36026,979,0001,067,0002,478,080
2May 7, 2026 08:363,40245,283,83627,190,0001,053,0002,490,368
3May 7, 2026 08:363,45342,973,02427,584,0001,081,0002,490,368
4May 7, 2026 08:363,54647,605,09428,355,0001,079,0002,486,272
5May 7, 2026 08:363,55846,059,48228,443,0001,095,0002,490,368
6May 7, 2026 08:363,55946,762,21128,464,0001,083,0002,478,080
7May 7, 2026 08:363,59448,170,38228,758,0001,080,0002,490,368
8May 7, 2026 08:363,60946,727,59328,874,0001,084,0002,494,464
9May 7, 2026 08:363,61745,409,70828,917,0001,111,0002,482,176