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 listMay 1, 2026 19:43Victor MerckléVictor MerckléScore: 10,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 19:4410,809108,969,11985,735,0003,987,0002,379,776
2May 1, 2026 19:4410,811106,306,33086,745,0002,991,0002,478,080
3May 1, 2026 19:4410,813109,245,26886,761,0002,991,0002,392,064
4May 1, 2026 19:4410,815110,073,18287,771,0001,994,0002,383,872
5May 1, 2026 19:4410,817106,966,89385,796,0003,990,0002,314,240
6May 1, 2026 19:4410,821103,993,70886,822,0002,993,0002,318,336
7May 1, 2026 19:4410,821108,550,13286,826,0002,994,0002,387,968
8May 1, 2026 19:4410,833107,349,07887,923,0001,998,0002,375,680
9May 1, 2026 19:4410,906112,683,55789,520,0001,005,0002,379,776