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 26, 2026 07:03Genos0Genos0Score: 2,066,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 07:032,065,01517,169,002,57117,070,657,00068,970,0002,293,760
2Feb 26, 2026 07:032,065,38817,176,784,14117,071,755,00070,965,0002,281,472
3Feb 26, 2026 07:032,065,41817,171,424,70017,079,992,00062,974,0002,281,472
4Feb 26, 2026 07:032,065,76117,175,825,39217,086,845,00058,975,0002,293,760
5Feb 26, 2026 07:032,066,16517,180,337,54617,072,208,00076,964,0002,281,472
6Feb 26, 2026 07:032,066,92717,189,514,08817,084,529,00070,968,0002,281,472
7Feb 26, 2026 07:032,067,63317,195,838,20617,089,390,00071,967,0002,281,472
8Feb 26, 2026 07:032,081,33617,306,081,88617,204,123,00070,967,0002,293,760
9Feb 26, 2026 07:032,129,23217,705,120,67317,606,655,00065,968,0002,281,472