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 27, 2026 00:22Code HintsCode HintsScore: 16,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 00:2216,101141,303,571132,638,0001,007,0002,113,536
2Jun 27, 2026 00:2216,130141,355,041132,873,0001,007,0002,113,536
3Jun 27, 2026 00:2216,141141,506,692132,968,0001,007,0002,113,536
4Jun 27, 2026 00:2216,142141,718,233132,977,0001,007,0002,113,536
5Jun 27, 2026 00:2216,144141,570,761132,992,0001,006,0002,113,536
6Jun 27, 2026 00:2216,151141,555,742133,051,0001,007,0002,113,536
7Jun 27, 2026 00:2216,153141,592,537133,068,0001,006,0002,113,536
8Jun 27, 2026 00:2216,179141,874,350133,280,0001,007,0002,113,536
9Jun 27, 2026 00:2216,336143,072,658134,585,0001,005,0002,113,536