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 16, 2026 22:20Adam FolwarcznyAdam FolwarcznyScore: 10,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2026 22:2010,343366,412,271338,324,0003,002,0002,473,984
2Jan 16, 2026 22:2010,369362,567,685337,159,0005,002,0002,514,944
3Jan 16, 2026 22:2010,539375,082,426343,799,0003,997,0002,428,928