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 21, 2025 21:52Valentin KofmanValentin KofmanScore: 61,063Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 21:5261,019534,288,579505,454,0001,000,0002,404,352
2Jun 21, 2025 21:5261,063529,596,046505,827,000999,0002,273,280
3Jun 21, 2025 21:5261,073529,542,708504,906,0001,999,0002,400,256