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 12, 2026 22:11Adam FolwarcznyAdam FolwarcznyScore: 62,980Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 22:1162,8512,097,965,9442,064,082,0009,995,0002,469,888
2Jan 12, 2026 22:1162,9802,114,178,5202,066,357,00011,996,0002,519,040
3Jan 12, 2026 22:1163,2882,119,688,5122,074,513,00013,989,0002,310,144