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 8, 2026 09:37anboto1anboto1Score: 5,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 09:385,478190,019,207171,662,0009,138,0002,117,632
2Jun 8, 2026 09:385,497190,809,224172,178,0009,243,0002,117,632
3Jun 8, 2026 09:385,504190,960,409173,286,0008,347,0002,117,632
4Jun 8, 2026 09:385,504191,312,624172,452,0009,193,0002,117,632
5Jun 8, 2026 09:385,519191,873,496172,925,0009,210,0002,117,632
6Jun 8, 2026 09:385,526192,096,118173,097,0009,262,0002,117,632
7Jun 8, 2026 09:385,526192,112,913173,186,0009,187,0002,117,632
8Jun 8, 2026 09:385,542192,102,167173,562,0009,328,0002,117,632
9Jun 8, 2026 09:385,589193,660,695175,124,0009,319,0002,117,632