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 listApr 18, 2024 10:10Joad NacerJoad NacerScore: 25,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2024 10:1024,970885,300,091824,012,67702,301,952
2Apr 18, 2024 00:3624,993884,057,987824,758,54002,306,048
3Apr 18, 2024 00:3625,136889,626,707829,497,59702,293,760
4Apr 18, 2024 10:1025,162884,710,700830,347,42402,285,568
5Apr 18, 2024 00:3625,167884,581,608830,517,55602,297,856
6Apr 18, 2024 10:1025,171896,940,834830,649,04802,306,048