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 26, 2026 19:56Kevin HeaveyKevin HeaveyScore: 1,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 20:011,52745,815,319108,330,0001,036,000585,728
2Sep 26, 2026 20:011,53646,109,289108,065,0002,088,000589,824
3Sep 26, 2026 20:011,53946,176,897108,101,0002,028,000581,632
4Sep 26, 2026 20:011,54046,217,571108,375,0002,009,000585,728
5Sep 26, 2026 20:011,54546,374,529108,627,0002,097,000589,824
6Sep 26, 2026 20:011,54946,476,010108,166,0003,040,000593,920
7Sep 26, 2026 20:011,54946,484,427109,987,0001,011,000581,632
8Sep 26, 2026 20:011,55346,596,088110,525,0001,012,000581,632
9Sep 26, 2026 20:011,55546,663,235109,692,0002,023,000589,824