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 listFeb 6, 2025 09:22NoSIMD_C#NoSIMD_C#Score: 87,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2025 09:2286,7852,890,549,0672,812,931,00050,962,0002,400,256
2Feb 6, 2025 09:2287,1822,906,055,3562,830,036,00046,967,0002,486,272
3Feb 6, 2025 09:2287,6922,920,312,1662,846,865,00046,964,0002,543,616