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 listMar 4, 2026 16:27juniskewljuniskewlScore: 55,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 16:2755,338485,500,461458,302,0001,000,0002,285,568
2Mar 4, 2026 16:2755,345490,482,751457,364,0001,997,0002,289,664
3Mar 4, 2026 16:2755,353488,181,150457,430,0001,997,0002,269,184
4Mar 4, 2026 16:2755,372489,222,004457,586,0001,998,0002,285,568
5Mar 4, 2026 16:2755,567483,654,908460,209,0001,000,0002,277,376
6Mar 4, 2026 16:2755,622487,357,623459,668,0001,998,0002,269,184
7Mar 4, 2026 16:2755,631483,616,283459,743,0001,998,0002,285,568
8Mar 4, 2026 16:2755,652486,708,749459,914,0001,999,0002,523,136
9Mar 4, 2026 16:2755,703488,881,551461,339,000998,0002,265,088