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 23, 2026 18:50Victor MerckléVictor MerckléScore: 3,809Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:523,72339,284,04529,790,0001,117,0002,117,632stderr
2Aug 23, 2026 18:523,73639,199,34729,890,0001,121,0002,117,632stderr
3Aug 23, 2026 18:523,77339,722,93630,232,0001,088,0002,117,632stderr
4Aug 23, 2026 18:523,78339,765,51230,311,0001,094,0002,117,632stderr
5Aug 23, 2026 18:523,80940,010,83030,507,0001,115,0002,117,632stderr
6Aug 23, 2026 18:523,83041,409,75430,668,0001,126,0002,117,632stderr
7Aug 23, 2026 18:523,83440,256,91630,678,0001,149,0002,117,632stderr
8Aug 23, 2026 18:523,90841,026,90931,329,0001,115,0002,117,632stderr
9Aug 23, 2026 18:524,00541,607,96632,151,0001,092,0002,117,632stderr