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 4, 2025 10:06NoSIMD_C#NoSIMD_C#Score: 91,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2025 10:0691,3243,049,936,9302,970,705,00042,981,0002,469,888
2Apr 4, 2025 10:0691,7473,058,420,1062,987,677,00039,982,0002,338,816
3Apr 4, 2025 10:06121,1264,030,777,7573,950,179,00046,966,0002,338,816