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 listMay 16, 2026 08:34M-RochatM-RochatScore: 28,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:3628,768958,260,508936,311,00013,038,0002,113,536
2May 16, 2026 08:3628,793960,108,772937,089,00013,094,0002,113,536
3May 16, 2026 08:3628,796959,095,188937,578,00012,718,0002,113,536
4May 16, 2026 08:3628,817961,719,764937,538,00013,446,0002,113,536
5May 16, 2026 08:3628,843960,736,790939,180,00012,640,0002,113,536
6May 16, 2026 08:3628,988968,280,460943,523,00013,087,0002,113,536
7May 16, 2026 08:3629,280976,763,319953,333,00012,915,0002,113,536
8May 16, 2026 08:3629,405991,189,288956,763,00013,618,0002,113,536
9May 16, 2026 08:3629,543984,612,239961,711,00013,208,0002,113,536