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 listAug 15, 2026 13:46Tomislav TunkovicTomislav TunkovicScore: 4,022Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 13:484,014140,952,225131,374,0001,119,00024,576
2Aug 15, 2026 13:484,014140,795,508131,462,0001,013,00024,576
3Aug 15, 2026 13:484,015141,134,046131,496,0001,008,00024,576
4Aug 15, 2026 13:484,018140,821,457131,544,0001,055,00024,576
5Aug 15, 2026 13:484,022141,081,016131,715,0001,016,00024,576
6Aug 15, 2026 13:484,026141,224,887131,875,0001,010,00024,576
7Aug 15, 2026 13:484,037141,584,781132,235,0001,002,00024,576
8Aug 15, 2026 13:484,037141,757,302132,231,0001,015,00024,576
9Aug 15, 2026 13:484,046141,864,613132,518,0001,005,00024,576