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 09:34Adam FolwarcznyAdam FolwarcznyScore: 14,285Success
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 09:3513,843124,203,662113,736,0001,162,0002,113,536
2Jun 29, 2026 09:3513,847124,298,064113,767,0001,168,0002,113,536
3Jun 29, 2026 09:3514,191127,157,236116,618,0001,173,0002,113,536
4Jun 29, 2026 09:3514,283127,836,959117,384,0001,165,0002,113,536
5Jun 29, 2026 09:3514,285127,967,344117,565,0001,001,0002,113,536
6Jun 29, 2026 09:3514,285127,902,491117,407,0001,164,0002,113,536
7Jun 29, 2026 09:3514,296127,970,331117,492,0001,170,0002,113,536
8Jun 29, 2026 09:3514,307128,189,279117,589,0001,162,0002,113,536
9Jun 29, 2026 09:3514,325129,425,175117,726,0001,176,0002,113,536