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 listSep 24, 2026 03:39wnwnScore: 3,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:433,62538,859,57827,821,0002,268,00020,480
2Sep 24, 2026 03:433,67439,331,01728,299,0002,198,00020,480
3Sep 24, 2026 03:433,68040,272,72628,261,0002,285,00020,480
4Sep 24, 2026 03:433,76440,693,98728,667,0002,575,0002,113,536
5Sep 24, 2026 03:433,79140,313,08829,165,0002,305,00020,480
6Sep 24, 2026 03:433,83441,863,47227,828,0003,996,0002,113,536
7Sep 24, 2026 03:433,83940,421,59527,944,0003,920,0002,113,536
8Sep 24, 2026 03:433,84640,693,95827,918,0004,009,0002,113,536
9Sep 24, 2026 03:433,89141,044,91427,289,0005,013,0002,113,536