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 9, 2025 15:18Serhat ErenSerhat ErenScore: 49,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2025 15:1849,958441,317,329409,659,0004,995,0002,269,184
2Oct 9, 2025 15:1849,961443,665,716413,681,000999,0002,269,184
3Oct 9, 2025 15:1849,969440,389,380412,746,0001,998,0002,269,184
4Oct 9, 2025 15:1849,969436,427,081413,746,000999,0002,269,184
5Oct 9, 2025 15:1849,983437,713,048410,863,0003,998,0002,396,160
6Oct 9, 2025 15:1849,986435,805,783412,881,0001,999,0002,404,352
7Oct 9, 2025 15:1849,997438,685,016410,980,0003,999,0002,269,184
8Oct 9, 2025 15:1850,024442,372,923413,196,0002,000,0002,269,184
9Oct 9, 2025 15:1850,036444,326,655414,301,0001,000,0002,269,184