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 02:48Victor MerckléVictor MerckléScore: 6,678Success
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 02:496,64863,357,39154,120,0001,059,0002,117,632stderr
2Aug 12, 2026 02:496,65163,586,48354,192,0001,013,0002,117,632stderr
3Aug 12, 2026 02:496,66565,135,19254,274,0001,047,0002,117,632stderr
4Aug 12, 2026 02:496,66663,766,06054,295,0001,037,0002,117,632stderr
5Aug 12, 2026 02:496,67863,597,07954,380,0001,053,0002,117,632stderr
6Aug 12, 2026 02:496,68563,636,03754,443,0001,043,0002,117,632stderr
7Aug 12, 2026 02:496,69863,937,90954,581,0001,019,0002,117,632stderr
8Aug 12, 2026 02:496,77864,695,13355,254,0001,011,0002,117,632stderr
9Aug 12, 2026 02:496,96366,002,43156,755,0001,043,0002,117,632stderr