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 27, 2025 22:31Valentin KofmanValentin KofmanScore: 7,971Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2025 22:316,12275,545,99048,821,0001,992,0002,289,664
2Jun 27, 2025 22:316,13176,459,64349,888,000997,0002,289,664
3Jun 27, 2025 22:316,17474,461,02850,238,0001,004,0002,289,664
4Jun 27, 2025 22:317,97189,447,44464,154,0002,004,0002,375,680
5Jun 27, 2025 22:317,97191,392,97565,158,0001,002,0002,289,664
6Jun 27, 2025 22:317,99495,326,58765,345,0001,005,0002,289,664