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 listMay 29, 2025 05:19NoSIMD_C#NoSIMD_C#Score: 88,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2025 05:1986,3532,879,042,2812,797,685,00051,975,0002,387,968
2May 29, 2025 05:1988,5572,953,579,4972,877,408,00044,975,0002,482,176
3May 29, 2025 05:1991,6233,071,056,7652,968,625,00054,937,0002,506,752