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 13, 2026 17:54Aleksei ShahoikaAleksei ShahoikaScore: 14,107Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:5614,028125,901,79594,707,00021,727,0002,113,536
2May 13, 2026 17:5614,052125,391,70994,821,00021,812,0002,113,536
3May 13, 2026 17:5614,091127,202,31794,638,00022,325,0002,113,536
4May 13, 2026 17:5614,100126,134,29894,649,00022,388,0002,113,536
5May 13, 2026 17:5614,107125,970,08195,272,00021,820,0002,113,536
6May 13, 2026 17:5614,135126,261,54294,965,00022,363,0002,113,536
7May 13, 2026 17:5614,187127,783,63494,607,00023,149,0002,113,536
8May 13, 2026 17:5614,212127,334,03694,799,00023,165,0002,113,536
9May 13, 2026 17:5614,336129,587,19494,760,00024,230,0002,113,536