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:50limanjun99limanjun99Error
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:500425,869,317327,757,00079,940,0002,367,488expected "1025961 ", got "1025961back:167764312,front:1251462732,"
2Apr 26, 2026 05:500422,523,609324,912,00078,978,0002,363,392expected "1021927 ", got "1021927back:167591084,front:1238982164,"
3Apr 26, 2026 05:500429,175,407338,093,00073,020,0002,379,776expected "1024596 ", got "1024596back:167925092,front:1264196412,"