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 17, 2026 12:18timothygktimothygkScore: 34,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 12:1934,567297,675,788285,747,0001,167,0002,113,536
2Oct 17, 2026 12:1934,571297,698,362285,764,0001,177,0002,113,536
3Oct 17, 2026 12:1934,572297,603,787285,775,0001,179,0002,113,536
4Oct 17, 2026 12:1934,572297,761,476285,769,0001,179,0002,113,536
5Oct 17, 2026 12:1934,576297,690,068285,795,0001,192,0002,113,536
6Oct 17, 2026 12:1935,025301,388,798289,704,0001,004,0002,113,536
7Oct 17, 2026 12:1935,812308,029,351295,980,0001,260,0002,113,536
8Oct 17, 2026 12:1935,886308,628,339296,613,0001,241,0002,113,536
9Oct 17, 2026 12:1935,892308,674,798296,653,0001,255,0002,113,536