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 19:55Valentin KofmanValentin KofmanScore: 9,881Success
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 19:559,829108,476,50080,577,0001,007,0002,281,472
2Jun 23, 2025 19:559,836107,428,84881,641,00002,289,664
3Jun 23, 2025 19:559,860107,960,25480,842,000998,0002,289,664
4Jun 23, 2025 19:559,870102,686,17379,923,0001,998,0002,289,664
5Jun 23, 2025 19:559,877108,561,26279,984,0001,999,0002,269,184
6Jun 23, 2025 19:559,880104,968,77680,004,0002,000,0002,289,664
7Jun 23, 2025 19:559,881108,002,22980,015,0002,000,0002,289,664
8Jun 23, 2025 19:559,887105,855,70480,065,0002,001,0002,289,664
9Jun 23, 2025 19:559,892103,046,66080,099,0002,002,0002,289,664
10Jun 23, 2025 19:559,893106,375,59480,108,0002,002,0002,289,664
11Jun 23, 2025 19:559,905107,227,33981,211,0001,002,0002,265,088
12Jun 23, 2025 19:559,911105,901,65880,253,0002,006,0002,269,184