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 20, 2021 15:11Sergey StreminSergey StreminScore: 23,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2021 15:1022,952819,486,093757,420,70802,215,936
2Jun 20, 2021 15:1123,042814,950,996760,379,83902,191,360
3Jun 20, 2021 15:1023,067818,651,463761,194,63102,207,744
4Jun 20, 2021 15:1023,168834,694,024764,555,16602,224,128
5Jun 20, 2021 15:1123,185838,452,496765,115,11902,281,472
6Jun 20, 2021 15:1123,191834,923,020765,297,77802,211,840