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 listFeb 10, 2025 14:13E SequeiraE SequeiraScore: 80,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2025 14:1380,0202,671,678,6502,616,659,00023,987,0002,281,472
2Feb 10, 2025 14:1380,4932,685,429,1292,632,277,00023,984,0002,281,472
3Feb 10, 2025 14:1381,0112,697,052,5912,649,378,00023,985,0002,322,432