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 listNov 21, 2024 08:12NoSIMD_C#NoSIMD_C#Score: 324,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2024 08:12323,85510,742,139,88810,517,317,000169,908,0002,469,888
2Nov 21, 2024 08:12324,46910,771,092,98610,536,651,000170,832,0002,363,392
3Nov 21, 2024 08:12326,35010,829,986,99610,614,658,000154,892,0002,453,504