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 1, 2026 20:19Josu San MartinJosu San MartinScore: 6,480Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 20:196,13981,628,37248,959,0001,998,0002,314,240
2Jan 1, 2026 20:516,17082,540,67849,199,0002,008,0002,453,504
3Jan 1, 2026 20:516,17177,738,49249,215,0002,008,0002,412,544
4Jan 1, 2026 20:516,18476,746,96450,321,0001,006,0002,424,832
5Jan 1, 2026 20:196,18577,116,51948,317,0003,019,0002,408,448
6Jan 1, 2026 20:196,20277,928,88748,447,0003,027,0002,342,912
7Jan 1, 2026 20:516,48075,334,53652,789,000996,0002,306,048
8Jan 1, 2026 20:196,49083,645,80952,868,000997,0002,306,048
9Jan 1, 2026 20:196,49178,607,10552,880,000997,0002,490,368
10Jan 1, 2026 20:516,49280,516,00449,891,0003,991,0002,396,160
11Jan 1, 2026 20:516,51383,569,23252,055,0002,002,0002,514,944
12Jan 1, 2026 20:196,52882,890,57049,164,0005,016,0002,306,048