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 12, 2026 00:33Sergey SerebryakovSergey SerebryakovScore: 7,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 00:337,03383,012,37357,368,0001,006,0002,383,872
2Mar 12, 2026 00:337,03479,213,55757,375,0001,006,0002,392,064
3Mar 12, 2026 00:337,03587,359,37058,387,00002,273,280
4Mar 12, 2026 00:337,04481,531,96758,468,00002,273,280
5Mar 12, 2026 00:337,04782,074,62757,480,0001,008,0002,478,080
6Mar 12, 2026 00:337,05384,712,92356,558,0001,984,0002,400,256
7Mar 12, 2026 00:337,08384,836,62257,790,000996,0002,273,280
8Mar 12, 2026 00:337,08482,871,50758,797,00002,514,944
9Mar 12, 2026 00:337,09181,359,50756,858,0001,995,0002,396,160
10Mar 12, 2026 00:337,50985,724,78261,317,0001,005,0002,273,280
11Mar 12, 2026 00:337,51587,110,52161,366,0001,006,0002,519,040
12Mar 12, 2026 00:337,51892,256,08362,398,00002,273,280