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 listApr 8, 2025 14:21NoSIMD_C#NoSIMD_C#Score: 105,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2025 14:21105,2373,498,492,2103,426,856,00045,971,0002,330,624
2Apr 8, 2025 14:21105,6173,513,887,5663,435,386,00049,976,0002,351,104
3Apr 8, 2025 14:21106,0603,530,278,5973,453,006,00046,972,0002,523,136