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 9, 2026 14:35wnwnScore: 3,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 14:363,37541,950,01326,962,0001,054,0002,490,368
2May 9, 2026 14:363,38944,331,12627,049,0001,083,0002,486,272
3May 9, 2026 14:363,39043,512,75027,071,0001,067,0002,486,272
4May 9, 2026 14:363,39042,281,85127,062,0001,075,0002,494,464
5May 9, 2026 14:363,39142,366,28327,109,0001,042,0002,486,272
6May 9, 2026 14:363,40541,081,29027,227,0001,036,0002,478,080
7May 9, 2026 14:363,40644,641,91327,168,0001,110,0002,478,080
8May 9, 2026 14:363,46043,419,23027,639,0001,079,0002,486,272
9May 9, 2026 14:363,50243,477,42227,984,0001,084,0002,494,464