Unique strings Sergey Svistunov

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 listJul 15, 2024 00:32Jasper EdbrookeJasper EdbrookeScore: 483,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2024 00:32480,33315,910,038,29515,850,991,24002,310,144
2Jul 15, 2024 00:32483,04116,009,834,26815,940,356,96702,281,472
3Jul 15, 2024 00:32484,41116,058,725,62715,985,548,65702,236,416