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 17, 2026 09:39DavidDavidScore: 40,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 09:3940,438344,775,958334,638,0001,005,0002,113,536
2Jun 17, 2026 09:3940,764347,375,736337,336,0001,007,0002,113,536
3Jun 17, 2026 09:3940,789347,607,448337,552,0001,004,0002,113,536
4Jun 17, 2026 09:3940,815347,714,617337,762,0001,003,0002,113,536
5Jun 17, 2026 09:3940,818347,769,967337,793,0001,003,0002,113,536
6Jun 17, 2026 09:3940,848348,061,232338,036,0001,003,0002,113,536
7Jun 17, 2026 09:3940,874348,241,819338,257,0001,003,0002,113,536
8Jun 17, 2026 09:3940,880348,542,087337,307,0002,004,0002,113,536
9Jun 17, 2026 09:3941,284351,688,017341,653,0001,005,0002,113,536