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 10, 2025 03:14Ian MckibbenIan MckibbenScore: 245,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2025 03:14241,8908,022,818,9887,964,394,00017,989,0002,379,776
2Jan 10, 2025 03:14245,1548,124,647,7718,060,103,00029,981,0002,400,256
3Jan 10, 2025 03:14247,4558,201,541,7348,145,044,00020,984,0002,457,600