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 listDec 9, 2024 12:22NoSIMD_C#NoSIMD_C#Score: 87,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2024 12:2286,2472,870,125,8522,791,203,00054,964,0002,539,520
2Dec 9, 2024 12:2287,1202,903,328,9522,827,996,00046,966,0002,387,968
3Dec 9, 2024 12:2287,8002,927,280,3652,809,445,00087,951,0002,469,888