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 listJun 29, 2026 14:34Saif Al-HarthiSaif Al-HarthiScore: 19,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 14:3718,621163,853,345153,551,0001,005,0002,113,536
2Jun 29, 2026 14:3718,644164,097,898153,746,0001,006,0002,113,536
3Jun 29, 2026 14:3718,732164,754,450154,472,0001,006,0002,113,536
4Jun 29, 2026 14:3718,864165,869,972155,567,0001,005,0002,113,536
5Jun 29, 2026 14:3719,007167,037,795156,758,0001,008,0002,113,536
6Jun 29, 2026 14:3719,036167,344,956157,000,0001,006,0002,113,536
7Jun 29, 2026 14:3719,094167,906,209157,481,0001,007,0002,113,536
8Jun 29, 2026 14:3719,101168,162,577157,536,0001,007,0002,113,536
9Jun 29, 2026 14:3719,308169,566,851159,257,0001,006,0002,113,536