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 22:46Valentin KofmanValentin KofmanScore: 12,572Success
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 22:469,700103,158,01879,500,0001,006,0002,371,584
2Jun 24, 2025 22:469,732108,978,34480,776,00002,289,664
3Jun 24, 2025 22:469,754105,107,47678,962,0001,999,0002,277,376
4Jun 24, 2025 22:459,781104,046,43479,179,0002,004,0002,277,376
5Jun 24, 2025 22:459,789105,029,89879,243,0002,006,0002,289,664
6Jun 24, 2025 22:459,831110,153,65281,598,00002,265,088
7Jun 24, 2025 22:4512,572125,411,768102,343,0002,006,0002,281,472
8Jun 24, 2025 22:4612,583131,522,516103,434,0001,004,0002,289,664
9Jun 24, 2025 22:4512,591127,873,338103,505,0001,004,0002,285,568
10Jun 24, 2025 22:4512,592131,792,476103,511,0001,004,0002,289,664
11Jun 24, 2025 22:4612,628131,228,941102,817,0001,996,0002,289,664
12Jun 24, 2025 22:4612,631138,141,175102,842,0001,996,0002,273,280