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 3, 2025 05:32NoSIMD_C#NoSIMD_C#Score: 146,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 05:32143,5314,765,380,0114,719,534,00016,991,0002,498,560
2Feb 3, 2025 05:32146,7884,874,965,8124,821,035,00022,985,0002,273,280
3Feb 3, 2025 05:32151,6575,029,569,1434,983,699,00020,986,0002,527,232