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 10, 2026 14:34Sergey SerebryakovSergey SerebryakovScore: 9,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 14:348,24192,102,45767,399,0001,005,0002,273,280
2Mar 10, 2026 14:348,24692,744,43267,436,0001,006,0002,273,280
3Mar 10, 2026 14:348,36894,032,94868,445,0001,006,0002,400,256
4Mar 10, 2026 14:349,149103,569,92774,936,000999,0002,273,280
5Mar 10, 2026 14:349,161101,622,13474,037,0002,001,0002,392,064
6Mar 10, 2026 14:349,161102,561,69975,034,0001,000,0002,400,256
7Mar 10, 2026 14:349,16298,261,79974,044,0002,001,0002,273,280
8Mar 10, 2026 14:349,165100,639,03575,069,0001,000,0002,273,280
9Mar 10, 2026 14:349,16598,741,10675,069,0001,000,0002,273,280
10Mar 10, 2026 14:349,167105,007,96674,080,0002,002,0002,273,280
11Mar 10, 2026 14:349,16998,443,41874,101,0002,002,0002,273,280
12Mar 10, 2026 14:349,177101,141,71074,169,0002,004,0002,273,280