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 07:21NoSIMD_C#NoSIMD_C#Score: 135,006Success
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 07:21134,7334,482,060,6854,424,200,00021,986,0002,297,856
2Apr 8, 2025 07:21135,0064,485,102,3074,426,214,00028,981,0002,301,952
3Apr 8, 2025 07:21138,5494,606,618,1854,554,133,00017,988,0002,400,256