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 listDec 10, 2025 04:23Thomas McClaveThomas McClaveScore: 2,066,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 10, 2025 04:232,062,95917,157,914,49517,065,583,00056,975,0002,277,376
2Dec 10, 2025 04:232,064,42917,167,651,62617,048,797,00085,963,0002,277,376
3Dec 10, 2025 04:232,064,99017,169,733,49617,070,449,00068,969,0002,277,376
4Dec 10, 2025 04:232,065,93617,182,671,25317,088,289,00058,976,0002,277,376
5Dec 10, 2025 04:232,066,78817,190,281,08017,071,380,00082,962,0002,277,376
6Dec 10, 2025 04:232,067,14917,195,824,91417,089,369,00067,969,0002,277,376
7Dec 10, 2025 04:232,067,69217,192,878,95717,091,873,00069,970,0002,277,376
8Dec 10, 2025 04:232,069,09517,203,853,00517,108,516,00064,975,0002,285,568
9Dec 10, 2025 04:232,069,28517,222,201,02117,098,118,00076,946,0002,277,376