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 11:46Valentin KofmanValentin KofmanScore: 7,965Success
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 11:466,06771,316,05749,351,0001,007,0002,289,664
2Jun 25, 2025 11:466,09375,046,61249,563,0001,011,0002,289,664
3Jun 25, 2025 11:466,09576,102,39349,577,0001,011,0002,289,664
4Jun 25, 2025 11:467,96589,657,06165,112,0001,001,0002,289,664
5Jun 25, 2025 11:467,98785,999,74564,286,0002,008,0002,265,088
6Jun 25, 2025 11:468,02094,368,38865,561,0001,008,0002,289,664