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 listMar 2, 2026 15:21caandocaandoScore: 5,301Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 15:215,28665,996,08141,882,0001,994,0002,285,568
2Mar 2, 2026 15:215,28869,551,71141,897,0001,995,0002,285,568
3Mar 2, 2026 15:215,28968,506,79741,906,0001,995,0002,527,232
4Mar 2, 2026 15:215,29170,921,33742,921,000998,0002,265,088
5Mar 2, 2026 15:215,29871,012,54642,976,000999,0002,523,136
6Mar 2, 2026 15:215,29865,511,23341,973,0001,998,0002,527,232
7Mar 2, 2026 15:215,30165,505,20842,001,0002,000,0002,277,376
8Mar 2, 2026 15:215,30365,671,50042,011,0002,000,0002,527,232
9Mar 2, 2026 15:215,31265,575,89442,089,0002,004,0002,289,664
10Mar 2, 2026 15:215,40070,041,61743,827,000996,0002,285,568
11Mar 2, 2026 15:215,40070,181,42242,828,0001,992,0002,260,992
12Mar 2, 2026 15:215,41773,957,16842,960,0001,998,0002,285,568