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 12, 2026 16:58CheckHarryCheckHarryScore: 2,066,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2026 16:582,064,69317,178,317,92217,075,974,00060,978,0002,281,472
2Feb 12, 2026 16:582,064,98617,170,479,70617,068,409,00070,972,0002,523,136
3Feb 12, 2026 16:582,065,57217,175,865,84317,088,273,00055,971,0002,289,664
4Feb 12, 2026 16:582,066,33717,181,368,25217,070,628,00079,965,0002,514,944
5Feb 12, 2026 16:582,066,67317,191,415,06617,083,419,00069,968,0002,351,104
6Feb 12, 2026 16:582,067,44017,191,850,56817,092,792,00066,963,0002,293,760
7Feb 12, 2026 16:582,068,56417,206,295,04317,107,113,00061,971,0002,281,472
8Feb 12, 2026 16:582,068,96117,211,189,45517,095,406,00076,970,0002,281,472
9Feb 12, 2026 16:582,087,37017,356,123,76617,251,200,00073,970,0002,281,472