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:49Ian MckibbenIan MckibbenScore: 51,384Success
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:5146,069409,512,120381,374,0001,000,0002,510,848
2Jan 9, 2025 07:5146,084410,047,215382,496,00002,289,664
3Jan 9, 2025 07:5146,087409,002,271381,524,0001,001,0002,289,664
4Jan 9, 2025 07:4751,367450,247,430426,343,00002,342,912
5Jan 9, 2025 07:4751,384452,565,459425,483,0001,001,0002,289,664
6Jan 9, 2025 07:4751,410451,275,594425,703,000999,0002,506,752
7Jan 9, 2025 07:4959,085522,746,738489,408,0001,000,0002,281,472
8Jan 9, 2025 07:4959,219522,317,283489,521,0001,998,0002,289,664
9Jan 9, 2025 07:4959,232515,105,004489,626,0001,998,0002,289,664