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 listJun 22, 2025 05:51Ian MckibbenIan MckibbenScore: 19,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 05:5119,264655,967,380558,739,00076,964,0002,285,568
2Jun 22, 2025 05:5119,284658,864,178562,448,00073,927,0002,285,568
3Jun 22, 2025 05:5119,297661,056,312550,829,00085,973,0002,392,064
4Jun 22, 2025 05:5119,303661,664,462555,005,00082,000,0002,494,464
5Jun 22, 2025 05:5119,345662,264,350565,457,00072,930,0002,510,848
6Jun 22, 2025 05:5119,378669,167,183556,546,00082,932,0002,527,232
7Jun 22, 2025 05:5119,397665,565,121550,228,00089,873,0002,404,352
8Jun 22, 2025 05:5119,494670,755,422562,402,00080,913,0002,539,520
9Jun 22, 2025 05:5119,995685,062,838570,001,00089,842,0002,404,352