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 listDec 19, 2025 20:48idatsyidatsyScore: 34,357Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 20:4834,350311,413,824284,107,0001,000,0002,363,392
2Dec 19, 2025 20:4834,350309,979,243284,108,0001,000,0002,285,568
3Dec 19, 2025 20:4834,356314,719,555283,151,0002,001,0002,355,200
4Dec 19, 2025 20:4834,357308,357,876284,160,0001,000,0002,351,104
5Dec 19, 2025 20:4834,357309,555,593284,162,0001,000,0002,277,376
6Dec 19, 2025 20:4834,360311,140,808285,191,00002,347,008
7Dec 19, 2025 20:4834,368307,889,687284,256,0001,000,0002,285,568
8Dec 19, 2025 20:4834,372317,278,041285,291,00002,363,392
9Dec 19, 2025 20:4834,372316,646,826284,290,0001,001,0002,285,568