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 10, 2026 06:32Josu San MartinJosu San MartinScore: 5,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 06:325,565213,374,804178,643,0004,990,0002,269,184
2Jan 10, 2026 06:325,583212,513,736180,224,0004,004,0002,306,048
3Jan 10, 2026 06:325,594211,185,358180,608,0003,991,0002,510,848
4Jan 10, 2026 06:325,595209,649,997181,626,0002,993,0002,486,272
5Jan 10, 2026 06:325,604206,866,045181,936,0002,998,0002,379,776
6Jan 10, 2026 06:325,607212,303,552182,047,0003,000,0002,379,776
7Jan 10, 2026 06:325,639207,945,803184,078,0002,000,0002,383,872
8Jan 10, 2026 06:325,696210,180,393183,978,0003,999,0002,506,752
9Jan 10, 2026 06:325,701210,257,527185,146,0003,002,0002,379,776