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 15, 2026 08:29Victor MerckléVictor MerckléScore: 4,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 08:304,55446,365,28736,682,0001,124,0002,113,536
2Jun 15, 2026 08:304,55845,266,17636,726,0001,113,0002,113,536
3Jun 15, 2026 08:304,56245,311,29236,790,0001,077,0002,113,536
4Jun 15, 2026 08:304,56645,276,50436,811,0001,095,0002,113,536
5Jun 15, 2026 08:304,57645,423,66436,871,0001,113,0002,113,536
6Jun 15, 2026 08:304,58545,313,71337,016,0001,045,0002,113,536
7Jun 15, 2026 08:304,59945,576,04137,052,0001,120,0002,113,536
8Jun 15, 2026 08:304,62845,783,91337,276,0001,137,0002,113,536
9Jun 15, 2026 08:304,99048,820,90340,405,0001,019,0002,113,536