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 listOct 11, 2024 08:34Vladimir TatVladimir TatScore: 128,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 08:34128,2684,268,305,5784,213,855,00018,990,0002,301,952
2Oct 11, 2024 08:34128,5394,268,313,5384,220,790,00020,989,0002,535,424
3Oct 11, 2024 08:34131,3214,366,077,8324,311,611,00021,982,0002,338,816