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 13:24e1011e1011Score: 63,319Success
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 13:2462,983552,754,798456,787,00065,969,0002,519,040
2Oct 11, 2025 13:2463,070551,007,240457,546,00065,934,0002,510,848
3Oct 11, 2025 13:2463,237551,824,537454,887,00069,982,0002,383,872
4Oct 11, 2025 13:2463,290554,270,886459,394,00065,913,0002,281,472
5Oct 11, 2025 13:2463,319547,119,638457,603,00067,941,0002,281,472
6Oct 11, 2025 13:2463,323552,927,758458,635,00066,946,0002,510,848
7Oct 11, 2025 13:2463,331554,853,167459,690,00065,955,0002,289,664
8Oct 11, 2025 13:2463,369551,230,782456,967,00068,995,0002,277,376
9Oct 11, 2025 13:2463,381549,396,243460,058,00066,008,0002,265,088