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 listFeb 23, 2026 19:43wnwnScore: 5,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 19:435,01964,176,13640,643,0001,016,0002,490,368
2Feb 23, 2026 19:435,04065,746,71839,843,0001,992,0002,494,464
3Feb 23, 2026 19:435,07164,310,00240,085,0002,004,0002,494,464