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 listSep 12, 2026 15:06Kevin HeaveyKevin HeaveyScore: 3,819Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 15:073,70939,430,14629,561,0001,224,0002,113,536
2Sep 12, 2026 15:073,73239,748,74529,926,0001,050,0002,113,536
3Sep 12, 2026 15:073,77540,184,52130,299,0001,041,0002,113,536
4Sep 12, 2026 15:073,77840,265,23530,316,0001,042,0002,113,536
5Sep 12, 2026 15:073,81940,547,72630,606,0001,098,0002,113,536
6Sep 12, 2026 15:073,86240,933,74031,018,0001,038,0002,113,536
7Sep 12, 2026 15:073,86640,989,75131,043,0001,052,0002,113,536
8Sep 12, 2026 15:073,87141,520,25431,050,0001,080,0002,113,536
9Sep 12, 2026 15:073,88641,113,28531,021,0001,238,0002,113,536