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 1, 2026 08:01Karthik ReddyKarthik ReddyScore: 3,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 08:023,57138,675,67928,561,0001,081,0002,113,536
2Oct 1, 2026 08:023,57638,591,96328,593,0001,094,0002,113,536
3Oct 1, 2026 08:023,58538,774,66528,659,0001,097,0002,113,536
4Oct 1, 2026 08:023,58638,821,65828,669,0001,101,0002,113,536
5Oct 1, 2026 08:023,58738,773,70528,686,0001,088,0002,113,536
6Oct 1, 2026 08:023,58738,821,88628,687,0001,087,0002,113,536
7Oct 1, 2026 08:023,63339,102,28229,011,0001,144,0002,113,536
8Oct 1, 2026 08:023,66239,386,57929,308,0001,087,0002,113,536
9Oct 1, 2026 08:023,83742,227,14330,773,0001,082,0002,113,536