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 listJun 22, 2025 21:25Valentin KofmanValentin KofmanScore: 24,352Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 21:2524,324229,039,775199,895,0001,998,0002,289,664
2Jun 22, 2025 21:2524,352228,933,771200,120,0002,001,0002,277,376
3Jun 22, 2025 21:2524,356225,332,622200,154,0002,001,0002,289,664