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:39Victor MerckléVictor MerckléScore: 7,666Success
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:407,62171,647,24062,125,0001,133,0002,117,632stderr
2Aug 25, 2026 01:407,63872,166,82262,323,0001,076,0002,117,632stderr
3Aug 25, 2026 01:407,63871,816,45062,234,0001,162,0002,117,632stderr
4Aug 25, 2026 01:407,63871,865,25262,257,0001,142,0002,117,632stderr
5Aug 25, 2026 01:407,66672,006,50462,543,0001,087,0002,117,632stderr
6Aug 25, 2026 01:407,67772,129,98962,617,0001,108,0002,117,632stderr
7Aug 25, 2026 01:407,68672,282,50562,611,0001,183,0002,117,632stderr
8Aug 25, 2026 01:407,69872,285,89262,782,0001,112,0002,117,632stderr
9Aug 25, 2026 01:407,71372,428,12862,880,0001,139,0002,117,632stderr