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 listJan 10, 2025 03:17Ian MckibbenIan MckibbenScore: 252,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2025 03:17252,6388,366,824,1068,328,070,0008,994,0002,453,504
2Jan 10, 2025 03:17252,9538,386,269,5528,316,477,00030,983,0002,469,888
3Jan 10, 2025 03:17254,4468,426,888,6908,383,731,00012,991,0002,387,968