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 listAug 25, 2026 00:59Victor MerckléVictor MerckléScore: 7,205Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:007,08567,218,78157,674,0001,139,0002,117,632stderr
2Aug 25, 2026 01:007,13567,587,60558,145,0001,080,0002,117,632stderr
3Aug 25, 2026 01:007,14967,702,16958,253,0001,087,0002,117,632stderr
4Aug 25, 2026 01:007,20468,193,39158,710,0001,089,0002,117,632stderr
5Aug 25, 2026 01:007,20568,165,08058,704,0001,099,0002,117,632stderr
6Aug 25, 2026 01:007,21068,188,26258,837,0001,009,0002,117,632stderr
7Aug 25, 2026 01:007,23168,479,21058,864,0001,154,0002,117,632stderr
8Aug 25, 2026 01:007,24768,551,13859,080,0001,073,0002,117,632stderr
9Aug 25, 2026 01:007,37770,228,45660,171,0001,066,0002,117,632stderr