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 11, 2025 21:48Marco BarboneMarco BarboneScore: 30,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 21:4830,339278,367,843250,816,000999,0002,539,520
2Oct 11, 2025 21:4830,373279,257,651250,100,0002,000,0002,428,928
3Oct 11, 2025 21:4830,386277,313,566252,200,00002,277,376