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 25, 2025 10:03Valentin KofmanValentin KofmanScore: 9,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2025 10:037,73986,959,14362,225,0002,007,0002,269,184
2Jun 25, 2025 10:037,76995,118,84963,473,0001,007,0002,273,280
3Jun 25, 2025 10:037,78292,019,80463,580,0001,009,0002,260,992
4Jun 25, 2025 10:039,593103,070,84978,614,0001,007,0002,289,664
5Jun 25, 2025 10:039,616103,607,03377,815,0001,995,0002,289,664
6Jun 25, 2025 10:039,631105,170,39378,937,000999,0002,289,664