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: 116,197Success
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:21115,7473,848,844,9953,758,691,00060,962,0002,306,048
2Apr 8, 2025 14:21116,1973,865,333,5163,779,545,00054,964,0002,420,736
3Apr 8, 2025 14:21123,7394,117,030,4594,029,407,00053,965,0002,416,640