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 listJan 24, 2025 08:47NoSIMD_C#NoSIMD_C#Score: 91,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 24, 2025 08:4791,6083,051,998,3852,976,105,00046,970,0002,453,504
2Jan 24, 2025 08:4791,7393,058,658,6792,976,423,00050,973,0002,531,328
3Jan 24, 2025 08:4793,2993,105,464,1443,040,902,00037,973,0002,519,040