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 4, 2026 07:17Teow Hua JunTeow Hua JunScore: 9,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 07:179,79991,335,87580,160,0001,172,0002,117,632stderr
2Aug 4, 2026 07:179,80191,348,65480,180,0001,170,0002,117,632stderr
3Aug 4, 2026 07:179,82391,540,91780,354,0001,178,0002,117,632stderr
4Aug 4, 2026 07:179,84891,760,01780,579,0001,166,0002,117,632stderr
5Aug 4, 2026 07:179,85491,743,43180,629,0001,160,0002,117,632stderr
6Aug 4, 2026 07:179,85891,889,33080,793,0001,035,0002,117,632stderr
7Aug 4, 2026 07:179,87591,947,58080,780,0001,190,0002,117,632stderr
8Aug 4, 2026 07:179,87591,969,27080,817,0001,147,0002,117,632stderr
9Aug 4, 2026 07:179,90992,246,61781,177,0001,075,0002,117,632stderr