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 14, 2026 12:15Adam FolwarcznyAdam FolwarcznyScore: 14,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 14, 2026 12:1514,085485,679,373458,796,0005,997,0002,396,160
2Jan 14, 2026 12:1514,109488,108,425457,611,0007,993,0002,412,544
3Jan 14, 2026 12:1514,110484,287,018456,635,0008,992,0002,510,848
4Jan 14, 2026 12:1514,127487,897,339458,184,0008,003,0002,265,088
5Jan 14, 2026 12:1514,140488,537,790458,621,0007,993,0002,473,984
6Jan 14, 2026 12:1514,167493,043,173457,532,0009,989,0002,514,944
7Jan 14, 2026 12:1514,205491,892,844460,768,0007,995,0002,412,544
8Jan 14, 2026 12:1514,228496,218,135459,525,0009,989,0002,514,944
9Jan 14, 2026 12:1514,261497,258,605461,636,0008,992,0002,514,944