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 listJan 16, 2025 02:08Ian MckibbenIan MckibbenScore: 27,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 02:0827,894949,991,700829,540,00090,949,0002,379,776
2Jan 16, 2025 02:0827,941955,144,080838,142,00083,914,0002,375,680
3Jan 16, 2025 02:0828,015952,542,627842,533,00081,954,0002,510,848