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:30Marco BarboneMarco BarboneScore: 33,502Success
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:3033,478304,684,311276,871,000999,0002,277,376
2Oct 11, 2025 04:3033,502305,265,222276,065,0002,000,0002,281,472
3Oct 11, 2025 04:3033,503305,093,132277,074,0001,000,0002,281,472