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 11, 2026 15:39Victor MerckléVictor MerckléScore: 3,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 15:403,83640,237,00030,806,0001,035,0002,117,632stderr
2Aug 11, 2026 15:403,85140,284,56930,781,0001,184,0002,117,632stderr
3Aug 11, 2026 15:403,86440,493,78731,030,0001,042,0002,117,632stderr
4Aug 11, 2026 15:403,87740,645,70831,028,0001,155,0002,117,632stderr
5Aug 11, 2026 15:403,90140,790,74931,325,0001,057,0002,117,632stderr
6Aug 11, 2026 15:403,90140,817,55331,349,0001,033,0002,117,632stderr
7Aug 11, 2026 15:403,91140,911,80131,270,0001,192,0002,117,632stderr
8Aug 11, 2026 15:403,91440,885,77031,429,0001,058,0002,117,632stderr
9Aug 11, 2026 15:403,93241,063,00631,597,0001,039,0002,117,632stderr