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 25, 2026 01:57Victor MerckléVictor MerckléScore: 9,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:588,84281,828,26672,231,0001,161,0002,117,632stderr
2Aug 25, 2026 01:588,87983,286,15872,527,0001,175,0002,117,632stderr
3Aug 25, 2026 01:589,00583,088,69873,630,0001,113,0002,117,632stderr
4Aug 25, 2026 01:589,19884,787,77175,171,0001,174,0002,117,632stderr
5Aug 25, 2026 01:589,21484,913,26475,323,0001,160,0002,117,632stderr
6Aug 25, 2026 01:589,22484,919,62075,364,0001,197,0002,117,632stderr
7Aug 25, 2026 01:589,24285,098,66875,577,0001,133,0002,117,632stderr
8Aug 25, 2026 01:589,26785,285,99875,752,0001,169,0002,117,632stderr
9Aug 25, 2026 01:589,30193,787,33276,135,0001,070,0002,117,632stderr