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 25, 2026 18:36Ropi777Ropi777Score: 2,066,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 25, 2026 18:362,063,38417,154,480,91317,054,119,00071,970,0002,293,760
2Feb 25, 2026 18:362,064,20617,168,437,07317,063,946,00068,963,0002,289,664
3Feb 25, 2026 18:362,064,62017,168,449,29917,078,376,00057,974,0002,281,472
4Feb 25, 2026 18:362,065,74517,176,777,61917,081,711,00063,972,0002,289,664
5Feb 25, 2026 18:362,066,85617,184,377,82917,089,936,00064,969,0002,281,472
6Feb 25, 2026 18:362,067,13817,193,119,21017,097,266,00059,976,0002,351,104
7Feb 25, 2026 18:362,069,66217,210,366,07617,118,217,00059,976,0002,281,472
8Feb 25, 2026 18:362,141,40717,807,952,27117,700,705,00072,969,0002,514,944
9Feb 25, 2026 18:362,141,66717,810,727,32117,699,872,00075,965,0002,281,472