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 listMay 19, 2026 01:41Drew GarciaDrew GarciaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 01:4101,099,846,1491,062,393,00025,075,0002,113,536expected "1024259 ", got "2896251 "
2May 19, 2026 01:4101,111,959,7861,075,813,00026,204,0002,117,632expected "1022241 ", got "2891606 "
3May 19, 2026 01:4101,097,452,5821,062,013,00025,279,0002,113,536expected "1023373 ", got "2888730 "