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 19:50NoSIMD_C#NoSIMD_C#Score: 95,118Success
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 19:5093,4783,115,405,1563,028,803,00055,977,0002,322,432
2Apr 4, 2025 19:5095,1183,165,918,4473,083,939,00054,963,0002,396,160
3Apr 4, 2025 19:5097,1213,238,002,8493,150,039,00054,965,0002,387,968