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 listJul 30, 2025 03:34Marco BarboneMarco BarboneScore: 83,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2025 03:3483,737721,686,808693,016,0002,000,0002,289,664
2Jul 30, 2025 03:3483,749718,205,099694,114,0001,000,0002,289,664
3Jul 30, 2025 03:3483,769721,987,078694,281,0001,000,0002,265,088