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 27, 2026 01:11Victor MerckléVictor MerckléScore: 4,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 01:114,21243,176,02633,880,0001,082,0002,117,632stderr
2Aug 27, 2026 01:114,22943,394,97033,925,0001,180,0002,117,632stderr
3Aug 27, 2026 01:114,23343,450,37334,049,0001,090,0002,117,632stderr
4Aug 27, 2026 01:114,23743,523,59034,083,0001,087,0002,117,632stderr
5Aug 27, 2026 01:114,24243,508,85934,131,0001,085,0002,117,632stderr
6Aug 27, 2026 01:114,24743,581,91534,132,0001,124,0002,117,632stderr
7Aug 27, 2026 01:114,24943,625,82934,186,0001,088,0002,117,632stderr
8Aug 27, 2026 01:114,33544,980,37834,844,0001,137,0002,117,632stderr
9Aug 27, 2026 01:114,43545,043,86335,754,0001,058,0002,117,632stderr