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 6, 2026 18:12Sanketh B KSanketh B KScore: 2,067,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 18:122,066,25117,176,689,92217,072,917,00076,968,0002,281,472
2Apr 6, 2026 18:122,066,26617,182,299,14017,089,039,00060,968,0002,281,472
3Apr 6, 2026 18:122,067,25417,193,035,29617,077,243,00080,963,0002,281,472
4Apr 6, 2026 18:122,067,56117,195,690,15317,103,790,00056,969,0002,281,472
5Apr 6, 2026 18:122,067,62517,191,881,62117,092,316,00068,973,0002,281,472
6Apr 6, 2026 18:122,067,96917,201,540,60517,094,178,00069,967,0002,293,760
7Apr 6, 2026 18:122,070,94917,219,927,58017,124,908,00063,969,0002,281,472
8Apr 6, 2026 18:122,087,23317,353,510,13017,246,063,00077,968,0002,293,760
9Apr 6, 2026 18:122,144,43617,830,765,99217,715,858,00082,961,0002,281,472