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, 2025 14:35Valentin KofmanValentin KofmanScore: 6,929Success
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, 2025 14:356,60384,122,69252,816,0001,993,0002,269,184
2Jun 28, 2025 14:356,75279,999,44454,044,0002,001,0002,269,184
3Jun 28, 2025 14:356,92378,642,87856,457,0001,008,0002,289,664
4Jun 28, 2025 14:356,92978,585,78256,499,0001,008,0002,269,184
5Jun 28, 2025 14:356,93588,207,17856,551,0001,009,0002,289,664
6Jun 28, 2025 14:357,37285,268,02059,184,0002,006,0002,289,664