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 listApr 3, 2026 22:22Chukwuma Obi Chukwuma Obi Score: 2,067,315Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2026 22:222,064,54417,168,100,26317,059,754,00075,963,0002,281,472
2Apr 3, 2026 22:222,066,31917,184,801,34417,076,488,00073,963,0002,281,472
3Apr 3, 2026 22:222,066,91317,192,899,20917,087,410,00067,965,0002,293,760
4Apr 3, 2026 22:222,067,16717,186,650,50117,074,521,00082,968,0002,281,472
5Apr 3, 2026 22:222,067,31517,189,068,34417,089,743,00068,970,0002,281,472
6Apr 3, 2026 22:222,067,55017,189,678,77217,083,699,00076,967,0002,281,472
7Apr 3, 2026 22:222,067,68117,193,979,07417,090,788,00070,965,0002,281,472
8Apr 3, 2026 22:222,069,99517,212,681,87917,113,983,00066,972,0002,281,472
9Apr 3, 2026 22:222,070,26317,218,115,64917,107,223,00075,961,0002,281,472