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 13, 2026 21:06Daniel MastalerzDaniel MastalerzScore: 7,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 21:067,42095,012,56459,566,0002,019,0002,277,376
2Feb 13, 2026 21:067,42693,432,38858,606,0003,031,0002,514,944
3Feb 13, 2026 21:067,43988,461,00955,771,0005,975,0002,514,944
4Feb 13, 2026 21:067,44188,057,49955,783,0005,976,0002,347,008
5Feb 13, 2026 21:067,44293,003,84657,782,0003,985,0002,310,144
6Feb 13, 2026 21:067,44286,648,94057,787,0003,985,0002,269,184
7Feb 13, 2026 21:067,44487,415,26357,798,0003,986,0002,514,944
8Feb 13, 2026 21:067,44494,206,56457,799,0003,986,0002,265,088
9Feb 13, 2026 21:067,44785,818,97055,831,0005,981,0002,523,136
10Feb 13, 2026 21:067,56890,953,33859,823,0002,991,0002,260,992
11Feb 13, 2026 21:067,57290,136,25158,858,0003,990,0002,265,088
12Feb 13, 2026 21:067,57786,585,93659,898,0002,994,0002,318,336