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 13, 2026 23:13Adam FolwarcznyAdam FolwarcznyScore: 172,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 23:13172,2905,717,546,3782,868,268,0002,817,299,0002,523,136
2Jan 13, 2026 23:13172,8825,736,139,1452,982,965,0002,722,143,0002,514,944
3Jan 13, 2026 23:13173,9135,772,140,2352,942,525,0002,796,598,0002,523,136