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 listFeb 11, 2026 22:05olliecrowolliecrowScore: 6,002Success
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 21:515,66382,305,28946,000,0001,000,0002,355,200
2Feb 11, 2026 22:055,67970,562,00642,124,0005,014,0002,314,240
3Feb 11, 2026 21:515,68374,879,88045,158,0002,007,0002,375,680
4Feb 11, 2026 22:055,69075,484,94144,213,0003,014,0002,281,472
5Feb 11, 2026 22:055,71766,690,71846,440,0001,009,0002,334,720
6Feb 11, 2026 21:515,76276,675,03346,826,000996,0002,310,144
7Feb 11, 2026 21:516,00274,682,41048,823,000996,0002,334,720
8Feb 11, 2026 21:516,04880,163,71846,183,0004,015,0002,396,160
9Feb 11, 2026 21:516,05775,111,29347,256,0003,016,0002,301,952
10Feb 11, 2026 22:056,06375,740,06447,301,0003,019,0002,449,408
11Feb 11, 2026 22:056,08076,332,39548,450,0002,018,0002,514,944
12Feb 11, 2026 22:056,24382,662,28250,817,000996,0002,482,176