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 listJan 31, 2026 21:39olliecrowolliecrowScore: 6,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:126,03581,400,23147,087,0003,005,0002,383,872
2Feb 11, 2026 18:126,04972,740,81648,202,0002,008,0002,379,776
3Jan 31, 2026 21:396,06079,258,10748,290,0002,012,0002,396,160
4Feb 11, 2026 18:126,06573,172,04748,325,0002,013,0002,371,584
5Jan 31, 2026 21:396,07477,686,67148,395,0002,016,0002,351,104
6Jan 31, 2026 21:396,09176,306,06547,579,0002,973,0002,490,368
7Jan 31, 2026 21:396,36083,276,01448,806,0003,984,0002,347,008
8Jan 31, 2026 21:396,36277,085,51748,820,0003,985,0002,486,272
9Feb 11, 2026 18:126,37474,840,22449,912,0002,994,0002,420,736
10Feb 11, 2026 18:126,42073,697,77550,273,0003,016,0002,359,296
11Jan 31, 2026 21:396,43078,264,19250,345,0003,020,0002,342,912
12Feb 11, 2026 18:126,43077,253,44551,357,0002,014,0002,347,008