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 24, 2026 20:33Daniel MastalerzDaniel MastalerzScore: 5,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 20:335,37472,558,45741,567,0003,041,0002,326,528
2Feb 24, 2026 20:335,37972,193,71942,620,0002,029,0002,310,144
3Feb 24, 2026 20:335,39672,676,14740,807,0003,981,0002,326,528
4Feb 24, 2026 20:335,40369,871,78641,857,0002,989,0002,523,136
5Feb 24, 2026 20:335,41572,183,26941,947,0002,996,0002,310,144
6Feb 24, 2026 20:335,42366,605,55141,007,0004,000,0002,289,664
7Feb 24, 2026 20:335,45869,430,39841,272,0004,026,0002,318,336
8Feb 24, 2026 20:335,46365,764,69741,311,0004,030,0002,383,872
9Feb 24, 2026 20:335,47167,459,17541,377,0004,036,0002,318,336
10Feb 24, 2026 20:335,47266,662,74841,380,0004,037,0002,306,048
11Feb 24, 2026 20:335,49372,636,03442,550,0003,039,0002,265,088
12Feb 24, 2026 20:335,52973,901,38641,898,0003,990,0002,514,944