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 08:01NoSIMD_C#NoSIMD_C#Score: 96,613Success
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 08:0193,2433,105,913,3013,039,041,00037,975,0002,473,984
2Apr 8, 2025 08:0196,6133,214,687,7283,130,276,00057,968,0002,535,424
3Apr 8, 2025 08:0197,1293,235,537,5893,167,268,00037,979,0002,396,160