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 7, 2024 19:01GraceGraceScore: 536,428Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 19:01532,97117,647,420,13717,588,054,99702,215,936
2Jun 7, 2024 19:01534,40017,700,532,23617,635,199,37802,318,336
3Jun 7, 2024 19:01535,04017,725,059,07017,656,331,20602,297,856
4Jun 7, 2024 19:01536,42817,761,172,60517,702,121,42302,215,936
5Jun 7, 2024 19:01538,23217,823,780,04817,761,642,03402,240,512
6Jun 7, 2024 19:01540,27917,895,757,11417,829,208,13602,310,144