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 11, 2025 04:05Marco BarboneMarco BarboneScore: 33,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 04:0532,815298,016,761271,365,0001,001,0002,289,664
2Oct 11, 2025 04:0533,640307,230,331278,210,0001,000,0002,265,088
3Oct 11, 2025 04:0535,487325,639,303293,537,0001,001,0002,260,992