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 listJan 9, 2025 07:55Ian MckibbenIan MckibbenScore: 44,199Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 07:5544,195395,184,268365,817,000999,0002,506,752
2Jan 9, 2025 07:5544,199391,435,029364,856,0001,999,0002,510,848
3Jan 9, 2025 07:5544,246389,871,002366,239,0001,000,0002,347,008