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 listSep 24, 2026 19:13Kevin HeaveyKevin HeaveyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 19:1403,914,736,0353,863,915,00041,793,00020,480Exit with code 3: 1023324 N 659799 63688 23934 21481 21239 21066 21255 21155 21202 21261 21125 21284 21253 21183 21251 21148 M 15860 15707 16059 15620 15949 15588 15832 15954 126771 127241 142295 214963 205471 71165 8424 425 0 0 78stderr