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:52Ian MckibbenIan MckibbenScore: 18,900Success
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:5218,800641,428,976528,497,00091,912,0002,387,968
2Jun 22, 2025 05:5218,839645,145,212540,727,00080,959,0002,363,392
3Jun 22, 2025 05:5218,883646,704,647539,246,00083,882,0002,400,256
4Jun 22, 2025 05:5218,889653,142,361541,420,00081,912,0002,289,664
5Jun 22, 2025 05:5218,900648,253,615535,740,00087,957,0002,486,272
6Jun 22, 2025 05:5218,906654,824,967536,916,00086,986,0002,281,472
7Jun 22, 2025 05:5218,922646,865,828534,512,00089,918,0002,281,472
8Jun 22, 2025 05:5218,948654,255,086535,377,00089,895,0002,281,472
9Jun 22, 2025 05:5218,969646,536,387533,971,00091,995,0002,285,568