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 25, 2026 21:20Kevin HeaveyKevin HeaveyScore: 1,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 21:311,52845,857,851109,598,0000589,824
2Sep 25, 2026 21:311,53746,110,344110,023,0000589,824
3Sep 25, 2026 21:311,54746,430,408109,522,0002,028,000589,824
4Sep 25, 2026 21:311,59947,977,667111,579,0000593,920
5Sep 25, 2026 21:311,60048,020,580111,756,0000593,920
6Sep 25, 2026 21:311,61148,330,427112,283,0000573,440
7Sep 25, 2026 21:311,61948,576,489112,789,0000573,440
8Sep 25, 2026 21:311,62048,617,902111,851,0001,012,000573,440
9Sep 25, 2026 21:311,63349,016,698112,367,0001,007,000593,920