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 28, 2026 17:46glegleScore: 52,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 17:4652,180442,797,227378,697,00054,404,0002,113,536
2Jun 28, 2026 17:4652,215442,781,838378,986,00054,402,0002,113,536
3Jun 28, 2026 17:4652,229442,727,829379,208,00054,295,0002,113,536
4Jun 28, 2026 17:4652,253443,101,183378,118,00055,588,0002,113,536
5Jun 28, 2026 17:4652,287443,362,452378,576,00055,411,0002,113,536
6Jun 28, 2026 17:4652,352443,796,422378,139,00056,388,0002,113,536
7Jun 28, 2026 17:4652,399444,215,419379,426,00055,489,0002,113,536
8Jun 28, 2026 17:4652,421444,365,645379,808,00055,289,0002,113,536
9Jun 28, 2026 17:4652,583445,738,939381,159,00055,288,0002,113,536