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 27, 2024 15:40NoSIMD_C#NoSIMD_C#Score: 486,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2024 15:40485,54916,071,696,70215,785,273,000237,838,0002,441,216
2Nov 27, 2024 15:40486,32516,082,209,13315,799,916,000248,809,0002,310,144
3Nov 27, 2024 15:40488,39316,156,012,32515,868,150,000248,814,0002,351,104