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 17, 2026 16:37Tomislav TunkovicTomislav TunkovicScore: 3,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 17:033,056109,037,72499,858,0001,018,00020,480
2Aug 17, 2026 17:033,062109,409,812100,014,0001,042,00020,480
3Aug 17, 2026 17:033,072109,781,888100,334,0001,052,00020,480
4Aug 17, 2026 17:033,082109,967,818100,651,0001,067,00020,480
5Aug 17, 2026 17:033,084110,047,436100,776,0001,003,00020,480
6Aug 17, 2026 17:033,097110,438,059101,172,0001,042,00020,480
7Aug 17, 2026 17:033,099110,620,307101,228,0001,057,00020,480
8Aug 17, 2026 17:033,101110,778,585101,291,0001,044,00020,480
9Aug 17, 2026 17:033,131111,662,710102,303,0001,027,00020,480