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 23, 2026 12:53maomao9-0maomao9-0Score: 49,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 12:5449,393419,355,219408,943,0001,022,0002,113,536
2Jun 23, 2026 12:5449,401419,337,751409,027,0001,004,0002,113,536
3Jun 23, 2026 12:5449,406419,342,670409,067,0001,006,0002,113,536
4Jun 23, 2026 12:5449,406419,829,174408,068,0002,004,0002,113,536
5Jun 23, 2026 12:5449,407419,630,155408,067,0002,014,0002,113,536
6Jun 23, 2026 12:5449,412419,413,557409,122,0001,004,0002,113,536
7Jun 23, 2026 12:5449,413419,535,329408,114,0002,020,0002,113,536
8Jun 23, 2026 12:5449,423419,648,911408,122,0002,091,0002,113,536
9Jun 23, 2026 12:5449,435420,042,467408,309,0002,009,0002,113,536