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 14, 2026 08:05Daniel MastalerzDaniel MastalerzScore: 6,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 08:056,52078,488,57251,109,0003,006,0002,330,624
2Feb 14, 2026 08:056,52675,578,26049,148,0005,015,0002,281,472
3Feb 14, 2026 08:056,52979,916,64151,181,0003,010,0002,326,528
4Feb 14, 2026 08:056,55275,770,28949,350,0005,035,0002,318,336
5Feb 14, 2026 08:056,55776,381,43749,384,0005,039,0002,318,336
6Feb 14, 2026 08:056,55878,568,57449,390,0005,039,0002,306,048
7Feb 14, 2026 08:056,55984,874,30151,418,0003,024,0002,269,184
8Feb 14, 2026 08:056,56183,053,32450,426,0004,034,0002,330,624
9Feb 14, 2026 08:056,59683,021,90451,760,0002,986,0002,277,376
10Feb 14, 2026 08:056,65976,792,41450,244,0005,024,0002,277,376
11Feb 14, 2026 08:056,67977,601,63652,412,0003,023,0002,260,992
12Feb 14, 2026 08:056,72581,347,77851,829,0003,986,0002,322,432