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:31Valentin KofmanValentin KofmanScore: 8,572Success
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:316,50075,802,65051,952,0001,998,0002,289,664
2Jun 25, 2025 10:316,50477,107,24551,983,0001,999,0002,289,664
3Jun 25, 2025 10:316,51876,272,65052,094,0002,003,0002,371,584
4Jun 25, 2025 10:318,57298,094,52270,143,0001,002,0002,269,184
5Jun 25, 2025 10:318,60596,455,07970,414,0001,005,0002,289,664
6Jun 25, 2025 10:318,68495,432,16670,079,0002,002,0002,289,664