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 11, 2026 17:23Victor MerckléVictor MerckléScore: 4,179Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 17:254,16242,836,77133,502,0001,046,0002,117,632stderr
2Aug 11, 2026 17:254,16442,868,29133,472,0001,094,0002,117,632stderr
3Aug 11, 2026 17:254,16642,872,93833,510,0001,074,0002,117,632stderr
4Aug 11, 2026 17:254,16942,976,30633,581,0001,026,0002,117,632stderr
5Aug 11, 2026 17:254,17943,085,39433,616,0001,075,0002,117,632stderr
6Aug 11, 2026 17:254,18243,030,88733,578,0001,133,0002,117,632stderr
7Aug 11, 2026 17:254,20043,192,17633,683,0001,181,0002,117,632stderr
8Aug 11, 2026 17:254,23843,447,45934,047,0001,135,0002,117,632stderr
9Aug 11, 2026 17:254,31544,903,99234,697,0001,118,0002,117,632stderr