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 listJan 1, 2026 03:46KeefeKeefeScore: 19,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 03:4619,588674,472,297632,424,00013,987,0002,449,408
2Jan 1, 2026 03:4619,692673,187,547640,828,0008,997,0002,334,720
3Jan 1, 2026 03:4619,724675,365,096641,896,0008,998,0002,330,624
4Jan 1, 2026 03:4619,729684,057,211639,044,00012,000,0002,281,472
5Jan 1, 2026 03:4619,759677,008,120641,050,00011,000,0002,453,504
6Jan 1, 2026 03:4619,804678,491,733639,556,00013,990,0002,461,696
7Jan 1, 2026 03:4619,944685,697,702647,159,00010,985,0002,322,432
8Jan 1, 2026 03:4620,039682,410,212647,315,00013,985,0002,453,504
9Jan 1, 2026 03:4620,110685,286,592654,634,0008,994,0002,326,528