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 2, 2026 21:04Karthik ReddyKarthik ReddyScore: 3,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 21:073,7103,039,895,50126,343,0004,452,00020,480
2Oct 2, 2026 21:073,7133,039,916,86526,332,0004,494,00020,480
3Oct 2, 2026 21:073,7303,040,011,01626,318,0004,646,00020,480
4Oct 2, 2026 21:073,7363,040,082,57126,396,0004,615,00020,480
5Oct 2, 2026 21:073,7413,040,253,97926,357,0004,700,00020,480
6Oct 2, 2026 21:073,7433,040,210,25426,406,0004,667,00020,480
7Oct 2, 2026 21:073,7493,040,137,69726,202,0004,916,00020,480
8Oct 2, 2026 21:073,7643,040,311,43826,497,0004,747,00020,480
9Oct 2, 2026 21:073,8113,040,814,07526,749,0004,890,00020,480