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 2, 2026 12:26Rajarshi BasuRajarshi BasuScore: 3,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 12:263,416138,143,790110,722,0001,994,0002,285,568
2Jan 2, 2026 12:263,424138,827,763111,000,0002,000,0002,285,568
3Jan 2, 2026 12:263,431136,554,334110,213,0003,005,0002,285,568
4Jan 2, 2026 12:263,433144,369,163110,268,0003,007,0002,285,568
5Jan 2, 2026 12:263,535143,937,486113,661,0002,991,0002,428,928
6Jan 2, 2026 12:263,550145,759,530115,150,0002,002,0002,285,568