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 listNov 20, 2024 15:36NoSIMD_C#NoSIMD_C#Score: 360,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2024 15:36359,32811,890,811,32411,725,952,000131,886,0002,478,080
2Nov 20, 2024 15:36360,32911,931,956,09611,738,983,000151,883,0002,326,528
3Nov 20, 2024 15:36369,19912,217,860,46312,043,691,000139,891,0002,490,368