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 10:31NoSIMD_C#NoSIMD_C#Score: 90,459Success
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 10:3190,0852,998,594,3432,912,837,00059,955,0002,334,720
2Feb 6, 2025 10:3190,4593,009,071,2842,925,189,00059,962,0002,396,160
3Feb 6, 2025 10:3191,1083,038,719,1862,949,592,00056,972,0002,318,336