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 23, 2025 22:57Valentin KofmanValentin KofmanScore: 9,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 22:576,63075,192,15053,026,0002,000,0002,273,280
2Jun 23, 2025 22:576,70483,275,51554,631,0001,011,0002,289,664
3Jun 23, 2025 22:576,71982,080,85253,780,0001,991,0002,277,376
4Jun 23, 2025 22:579,03898,161,09173,015,0002,000,0002,265,088
5Jun 23, 2025 22:579,04897,713,19474,101,0001,001,0002,289,664
6Jun 23, 2025 22:579,073104,473,93873,301,0002,008,0002,289,664