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 29, 2026 15:40Victor MerckléVictor MerckléScore: 3,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 15:403,56938,012,06628,546,0001,080,0002,117,632stderr
2Aug 29, 2026 15:403,60338,271,60428,796,0001,111,0002,117,632stderr
3Aug 29, 2026 15:403,68939,026,41729,523,0001,100,0002,117,632stderr
4Aug 29, 2026 15:403,69839,077,54729,604,0001,093,0002,117,632stderr
5Aug 29, 2026 15:403,71039,613,32329,713,0001,087,0002,117,632stderr
6Aug 29, 2026 15:403,72239,239,77929,808,0001,090,0002,117,632stderr
7Aug 29, 2026 15:403,74339,442,84730,028,0001,041,0002,117,632stderr
8Aug 29, 2026 15:403,75739,491,73130,095,0001,092,0002,117,632stderr
9Aug 29, 2026 15:403,76939,687,13030,246,0001,037,0002,117,632stderr