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 09:26Valentin KofmanValentin KofmanScore: 9,405Success
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 09:267,57189,386,50660,842,0001,994,0002,289,664
2Jun 25, 2025 09:267,61089,942,47361,160,0002,005,0002,289,664
3Jun 25, 2025 09:267,66690,164,35963,625,00002,273,280
4Jun 25, 2025 09:269,405101,042,34177,062,0001,000,0002,289,664
5Jun 25, 2025 09:269,407101,059,52576,079,0002,002,0002,289,664
6Jun 25, 2025 09:269,415103,134,46576,143,0002,003,0002,289,664