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 listNov 12, 2025 15:18Aliaksandr MikheiAliaksandr MikheiScore: 103,380Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 15:18102,9163,425,125,3723,218,377,000177,855,0002,318,336
2Nov 12, 2025 15:17103,2663,440,979,3383,215,890,000191,874,0002,392,064
3Nov 12, 2025 15:17103,3133,438,068,2013,222,484,000186,854,0002,400,256
4Nov 12, 2025 15:17103,3803,435,827,2913,220,692,000190,863,0002,396,160
5Nov 12, 2025 15:18103,8023,454,983,2643,248,606,000176,869,0002,408,448
6Nov 12, 2025 15:18103,8093,459,920,9303,256,873,000168,837,0002,441,216