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 listJan 25, 2025 17:23bendnbendnScore: 56,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 17:2356,674504,996,083469,399,000998,0002,363,392
2Jan 25, 2025 17:2556,703495,817,653468,640,0001,998,0002,281,472
3Jan 25, 2025 17:2556,779496,156,884471,265,00002,289,664
4Jan 25, 2025 17:2556,780500,830,115470,273,0001,000,0002,289,664
5Jan 25, 2025 17:2356,783498,655,022470,303,0001,000,0002,289,664
6Jan 25, 2025 17:2556,785496,279,840470,316,0001,000,0002,375,680
7Jan 25, 2025 17:2556,787498,013,844470,331,0001,000,0002,289,664
8Jan 25, 2025 17:2556,815500,227,479469,564,0001,998,0002,289,664
9Jan 25, 2025 17:2556,818499,300,037469,590,0001,998,0002,289,664
10Jan 25, 2025 17:2356,831501,161,329470,702,000999,0002,289,664
11Jan 25, 2025 17:2356,849499,997,574469,850,0001,999,0002,371,584
12Jan 25, 2025 17:2356,854500,281,351470,890,000999,0002,289,664
13Jan 25, 2025 17:2356,864496,904,527469,970,0001,999,0002,289,664
14Jan 25, 2025 17:2356,877496,862,772471,078,0001,000,0002,281,472
15Jan 25, 2025 17:2556,896496,296,207472,240,00002,285,568
16Jan 25, 2025 17:2556,897494,546,631471,241,0001,000,0002,371,584
17Jan 25, 2025 17:2356,921499,565,861472,447,00002,289,664
18Jan 25, 2025 17:2356,923501,337,697472,462,00002,289,664