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 05:20anboto1anboto1Score: 6,780Success
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 05:216,729231,321,897205,352,00016,707,0002,117,632
2Jun 8, 2026 05:216,744231,795,991206,000,00016,584,0002,117,632
3Jun 8, 2026 05:216,771232,694,223206,685,00016,771,0002,117,632
4Jun 8, 2026 05:216,772232,836,441206,746,00016,756,0002,117,632
5Jun 8, 2026 05:216,780232,980,043207,081,00016,667,0002,117,632
6Jun 8, 2026 05:216,781233,416,162208,034,00015,744,0002,117,632
7Jun 8, 2026 05:216,795233,477,036207,439,00016,826,0002,117,632
8Jun 8, 2026 05:216,842235,175,813209,829,00015,978,0002,117,632
9Jun 8, 2026 05:216,852235,774,781210,171,00015,977,0002,117,632