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 18, 2026 20:30Mikołaj UzarskiMikołaj UzarskiScore: 5,778Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 20:355,75582,571,20341,795,0005,970,0002,412,544
2Feb 18, 2026 20:335,76574,218,99041,870,0005,981,0002,428,928
3Feb 18, 2026 20:355,76669,410,95642,872,0004,985,0002,387,968
4Feb 18, 2026 20:305,76781,745,16839,892,0007,978,0002,437,120
5Feb 18, 2026 20:335,77872,674,52341,964,0005,994,0002,412,544
6Feb 18, 2026 20:305,79270,282,17542,062,0006,008,0002,318,336
7Feb 18, 2026 20:305,80969,463,47743,196,0005,022,0002,437,120
8Feb 18, 2026 20:335,83770,244,83744,414,0004,037,0002,404,352
9Feb 18, 2026 20:355,93569,725,82642,223,0007,037,0002,428,928