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 listSep 4, 2024 15:13Yuriy LyfenkoYuriy LyfenkoScore: 30,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2024 15:1330,1571,027,809,388990,173,0004,995,0002,375,680
2Sep 4, 2024 15:1330,2131,025,231,093987,055,0009,990,0002,355,200
3Sep 4, 2024 15:1330,2641,025,795,823989,722,0008,997,0002,265,088