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 12:41Saif Al-HarthiSaif Al-HarthiScore: 27,165Success
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 12:4227,144234,599,313224,293,0001,007,0002,113,536
2Jun 29, 2026 12:4227,146234,655,227224,313,0001,006,0002,113,536
3Jun 29, 2026 12:4227,159234,736,967224,415,0001,006,0002,113,536
4Jun 29, 2026 12:4227,163234,844,797224,446,0001,007,0002,113,536
5Jun 29, 2026 12:4227,165234,753,717224,466,0001,007,0002,113,536
6Jun 29, 2026 12:4227,166234,823,870224,473,0001,008,0002,113,536
7Jun 29, 2026 12:4227,177234,894,628224,564,0001,007,0002,113,536
8Jun 29, 2026 12:4227,328236,148,301225,823,0001,007,0002,113,536
9Jun 29, 2026 12:4227,337236,286,790225,894,0001,008,0002,113,536