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 24, 2025 23:12Valentin KofmanValentin KofmanScore: 12,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2025 23:129,831114,086,59480,594,0001,007,0002,277,376
2Jun 24, 2025 23:129,840107,837,62980,674,000995,0002,289,664
3Jun 24, 2025 23:129,902108,431,08881,182,0001,002,0002,289,664
4Jun 24, 2025 23:1212,783131,388,358105,095,0001,000,0002,289,664
5Jun 24, 2025 23:1212,804127,809,672104,265,0002,005,0002,273,280
6Jun 24, 2025 23:1212,903141,113,432106,099,0001,000,0002,289,664