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 listMay 21, 2026 17:24M-RochatM-RochatScore: 21,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 17:2521,355640,675,171625,534,0004,252,0002,113,536
2May 21, 2026 17:2521,583647,512,339632,816,0004,014,0002,113,536
3May 21, 2026 17:2521,650649,519,838634,782,0004,065,0002,113,536
4May 21, 2026 17:2521,803654,100,702639,234,0004,279,0002,113,536
5May 21, 2026 17:2521,872656,189,479640,660,0004,122,0002,113,536
6May 21, 2026 17:2521,913657,396,304641,027,0004,072,0002,113,536
7May 21, 2026 17:2523,718711,558,996696,107,0004,316,0002,113,536
8May 21, 2026 17:2523,722711,664,844698,023,0004,013,0002,113,536
9May 21, 2026 17:2523,877716,322,572699,533,0004,288,0002,113,536