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 03:01Victor MerckléVictor MerckléScore: 10,203Success
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 03:0110,14892,604,39983,178,0001,054,0002,117,632stderr
2Aug 25, 2026 03:0110,14893,275,56583,156,0001,073,0002,117,632stderr
3Aug 25, 2026 03:0110,15093,331,76883,198,0001,054,0002,117,632stderr
4Aug 25, 2026 03:0110,17093,492,11383,362,0001,057,0002,117,632stderr
5Aug 25, 2026 03:0110,20393,151,29183,578,0001,112,0002,117,632stderr
6Aug 25, 2026 03:0110,20693,104,31583,638,0001,077,0002,117,632stderr
7Aug 25, 2026 03:0110,20893,151,31383,677,0001,051,0002,117,632stderr
8Aug 25, 2026 03:0110,22193,281,67683,790,0001,050,0002,117,632stderr
9Aug 25, 2026 03:0110,28994,422,20084,349,0001,054,0002,117,632stderr