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 8, 2025 07:03AryanAryanScore: 2,066,313Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 07:032,063,01317,158,597,15017,059,036,00063,970,0002,265,088
2Dec 8, 2025 07:032,064,38217,174,516,88617,064,409,00069,960,0002,277,376
3Dec 8, 2025 07:032,064,84317,170,745,52117,078,236,00059,965,0002,260,992
4Dec 8, 2025 07:032,065,51717,172,601,90917,089,813,00053,977,0002,277,376
5Dec 8, 2025 07:032,066,31317,180,415,52917,078,429,00071,972,0002,277,376
6Dec 8, 2025 07:032,066,60417,180,902,65717,080,849,00071,965,0002,277,376
7Dec 8, 2025 07:032,067,81817,192,497,78917,076,922,00085,964,0002,277,376
8Dec 8, 2025 07:032,157,72717,947,263,00317,820,185,00088,951,0002,277,376
9Dec 8, 2025 07:032,159,91817,958,604,00517,867,356,00059,967,0002,265,088