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 7, 2025 16:03Aleksei ShahoikaAleksei ShahoikaScore: 37,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2025 16:0337,292337,042,600309,520,00002,285,568
2Sep 7, 2025 16:0337,314332,969,508307,711,0001,998,0002,285,568
3Sep 7, 2025 16:0337,323331,770,862307,786,0001,998,0002,265,088
4Sep 7, 2025 16:0337,327330,022,694308,814,000999,0002,260,992
5Sep 7, 2025 16:0337,361331,645,864308,093,0002,000,0002,285,568
6Sep 7, 2025 16:0337,415334,281,551308,547,0001,997,0002,265,088
7Sep 7, 2025 16:0337,434336,932,987309,700,000999,0002,285,568
8Sep 7, 2025 16:0337,569333,245,878309,825,0001,998,0002,285,568
9Sep 7, 2025 16:0337,799336,819,146311,731,0001,998,0002,277,376