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 6, 2026 15:43merripiummerripiumScore: 71,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 15:4471,501602,674,871537,960,00055,506,0002,113,536
2Jun 6, 2026 15:4471,529604,711,633538,249,00055,446,0002,113,536
3Jun 6, 2026 15:4471,555603,112,517538,449,00055,458,0002,113,536
4Jun 6, 2026 15:4471,556603,088,067538,420,00055,495,0002,113,536
5Jun 6, 2026 15:4471,564603,152,215538,506,00055,480,0002,113,536
6Jun 6, 2026 15:4471,595603,432,538537,773,00056,473,0002,113,536
7Jun 6, 2026 15:4471,607603,405,551537,930,00056,409,0002,113,536
8Jun 6, 2026 15:4471,635603,559,383538,099,00056,474,0002,113,536
9Jun 6, 2026 15:4471,702604,338,232538,637,00056,491,0002,113,536