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 20:12Valentin KofmanValentin KofmanScore: 7,828Success
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 20:127,79293,585,52563,667,0001,010,0002,273,280
2Jun 23, 2025 20:127,81293,188,59964,841,00002,416,640
3Jun 23, 2025 20:127,82393,399,00463,933,000998,0002,289,664
4Jun 23, 2025 20:127,82890,961,31062,974,0001,999,0002,375,680
5Jun 23, 2025 20:127,83486,406,30063,025,0002,000,0002,265,088
6Jun 23, 2025 20:127,88786,569,10964,458,0001,007,0002,289,664