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 listOct 17, 2026 03:44e1011e1011Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 03:4505,760,150,0715,746,948,0002,052,0002,113,536expected "1025590 ", got "1025304 "
2Oct 17, 2026 03:4505,764,090,1065,750,959,0002,198,0002,113,536expected "1022936 ", got "1022688 "
3Oct 17, 2026 03:4505,787,290,3575,774,339,0002,027,0002,113,536expected "1026511 ", got "1026233 "