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 listOct 17, 2025 13:02RyogaRyogaScore: 78,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2025 13:0278,413674,835,276437,886,000212,944,0002,351,104
2Oct 17, 2025 13:0278,771681,836,426438,868,000214,935,0002,347,008
3Oct 17, 2025 13:0278,820682,139,894439,465,000214,739,0002,338,816
4Oct 17, 2025 13:0278,858680,916,217438,678,000215,842,0002,338,816
5Oct 17, 2025 13:0278,864675,603,677439,711,000214,858,0002,338,816
6Oct 17, 2025 13:0279,208680,245,000438,618,000218,809,0002,260,992
7Oct 17, 2025 13:0279,211679,700,140438,634,000218,817,0002,347,008
8Oct 17, 2025 13:0279,230680,089,032438,741,000218,871,0002,355,200
9Oct 17, 2025 13:0279,322684,782,725438,582,000219,790,0002,330,624