Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listSep 9, 2024 02:40Yuriy LyfenkoYuriy LyfenkoScore: 6,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2024 02:406,630198,888,598511,360,0002,001,0002,502,656
2Sep 9, 2024 02:406,702201,065,576509,181,0002,004,0002,875,392
3Sep 9, 2024 02:406,768203,035,070522,470,0001,997,0002,723,840
4Sep 9, 2024 02:406,815204,454,284520,540,0004,995,0002,715,648
5Sep 9, 2024 02:406,836205,069,363509,379,0004,002,0002,629,632
6Sep 9, 2024 02:406,898206,939,378523,082,0001,000,0002,953,216
7Sep 9, 2024 02:406,905207,162,073523,760,0002,002,0002,633,728
8Sep 9, 2024 02:406,940208,186,236521,357,0002,996,0002,551,808
9Sep 9, 2024 02:407,148214,432,360521,969,0002,994,0002,592,768