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 4, 2023 09:43АндрейАндрейScore: 77,920Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2023 09:4377,6492,624,781,7572,562,428,74402,195,456
2Jun 4, 2023 09:3677,8942,651,335,5332,570,517,70902,314,240
3Jun 4, 2023 09:3677,9042,630,010,1042,570,837,29702,322,432
4Jun 4, 2023 09:4377,9202,637,207,1832,571,353,25702,195,456
5Jun 4, 2023 09:3678,2862,649,946,1092,583,450,89902,191,360
6Jun 4, 2023 09:4378,3722,644,631,5762,586,268,57702,191,360