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:58NoSIMD_C#NoSIMD_C#Score: 93,404Success
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:5893,2373,110,657,3873,033,862,00042,969,0002,318,336
2Apr 8, 2025 07:5893,4043,111,183,7263,032,390,00049,957,0002,351,104
3Apr 8, 2025 07:5895,0513,169,752,3353,083,729,00052,961,0002,322,432