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 9, 2021 06:37Sergey StreminSergey StreminScore: 24,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2021 06:3524,481872,286,789807,881,73202,293,760
2Jun 9, 2021 06:3524,502870,707,025808,573,19202,289,664
3Jun 9, 2021 06:3724,519885,046,676809,116,15302,285,568
4Jun 9, 2021 06:3724,614900,265,144812,247,59702,277,376
5Jun 9, 2021 06:3724,759888,708,600817,063,32602,281,472
6Jun 9, 2021 06:3524,780888,203,947817,741,92302,293,760