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 listDec 11, 2025 15:17Bernard TeoBernard TeoScore: 6,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 15:186,43978,824,34353,447,00002,273,280
2Dec 11, 2025 15:176,43978,940,04252,438,0001,008,0002,404,352
3Dec 11, 2025 15:176,44673,650,49752,493,0001,009,0002,273,280
4Dec 11, 2025 15:176,45074,616,20952,523,0001,010,0002,387,968
5Dec 11, 2025 15:176,45477,190,53452,556,0001,010,0002,404,352
6Dec 11, 2025 15:176,45682,467,50952,571,0001,010,0002,273,280
7Dec 11, 2025 15:176,45780,381,79052,581,0001,011,0002,273,280
8Dec 11, 2025 15:186,45784,356,19152,580,0001,011,0002,273,280
9Dec 11, 2025 15:186,46081,103,92352,603,0001,011,0002,514,944
10Dec 11, 2025 15:186,46680,717,15953,671,00002,408,448
11Dec 11, 2025 15:176,48279,128,77552,804,000996,0002,273,280
12Dec 11, 2025 15:176,48384,161,68852,817,000996,0002,273,280
13Dec 11, 2025 15:176,48480,600,92651,823,0001,993,0002,273,280
14Dec 11, 2025 15:176,48579,394,90651,832,0001,993,0002,273,280
15Dec 11, 2025 15:186,48681,063,76951,838,0001,993,0002,273,280
16Dec 11, 2025 15:176,48876,527,79053,851,00002,396,160
17Dec 11, 2025 15:186,49480,777,00952,899,000998,0002,273,280
18Dec 11, 2025 15:176,50074,713,73952,948,000999,0002,273,280