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 14:05anboto1anboto1Score: 5,481Success
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 14:065,417188,028,007170,441,0008,333,0002,117,632
2Jun 8, 2026 14:065,460189,697,623171,005,0009,179,0002,117,632
3Jun 8, 2026 14:065,468189,650,370172,209,0008,237,0002,117,632
4Jun 8, 2026 14:065,479190,132,618171,520,0009,290,0002,117,632
5Jun 8, 2026 14:065,481190,554,190171,694,0009,187,0002,117,632
6Jun 8, 2026 14:065,489190,384,324171,877,0009,288,0002,117,632
7Jun 8, 2026 14:065,494190,933,000172,002,0009,319,0002,117,632
8Jun 8, 2026 14:065,520191,423,669172,895,0009,288,0002,117,632
9Jun 8, 2026 14:065,559193,228,233174,133,0009,344,0002,117,632