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 listApr 26, 2026 05:57limanjun99limanjun99Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 05:580375,891,087297,931,00058,986,0002,535,424expected "1026025 ", got "1026025back:237049240,front:1001363380,"
2Apr 26, 2026 05:580374,735,002282,738,00073,931,0002,334,720expected "1020930 ", got "1020930back:242135568,front:995961764,"
3Apr 26, 2026 05:580372,439,232286,581,00069,897,0002,510,848expected "1018713 ", got "1018713back:236165376,front:1000984556,"