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 12, 2026 15:30Victor MerckléVictor MerckléScore: 3,796Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 15:313,75839,623,65430,061,0001,135,0002,117,632stderr
2Aug 12, 2026 15:313,76140,111,10830,029,0001,193,0002,117,632stderr
3Aug 12, 2026 15:313,77439,740,74230,208,0001,124,0002,117,632stderr
4Aug 12, 2026 15:313,78039,870,23130,241,0001,139,0002,117,632stderr
5Aug 12, 2026 15:313,79639,702,42830,415,0001,100,0002,117,632stderr
6Aug 12, 2026 15:313,79839,913,50130,420,0001,108,0002,117,632stderr
7Aug 12, 2026 15:313,79939,989,11330,440,0001,097,0002,117,632stderr
8Aug 12, 2026 15:313,81240,052,15030,547,0001,094,0002,117,632stderr
9Aug 12, 2026 15:313,88940,650,23731,214,0001,069,0002,117,632stderr