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 05:31wnwnScore: 4,131Success
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 05:374,03042,296,31833,455,000020,480
2Sep 24, 2026 05:374,04643,031,73532,486,0001,103,00020,480
3Sep 24, 2026 05:374,05142,461,00133,626,000020,480
4Sep 24, 2026 05:374,11342,888,27133,091,0001,055,00020,480
5Sep 24, 2026 05:374,13143,754,55033,260,0001,028,0002,113,536
6Sep 24, 2026 05:374,15744,022,39833,312,0001,199,0002,113,536
7Sep 24, 2026 05:374,29245,854,71532,642,0002,986,0002,113,536
8Sep 24, 2026 05:374,30945,240,82832,821,0002,950,0002,113,536
9Sep 24, 2026 05:374,35745,665,26932,828,0003,341,0002,113,536