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:29limanjun99limanjun99Error
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:300786,147,796698,820,00064,983,0002,347,008expected "1024900 ", got "1024900nani:1125496680,back:167213784,front:2533087964,"
2Apr 26, 2026 05:300781,877,674686,358,00075,929,0002,351,104expected "1018657 ", got "1018657nani:1124913188,back:167331440,front:2527081980,"
3Apr 26, 2026 05:300785,417,843700,518,00066,954,0002,383,872expected "1020159 ", got "1020159nani:1127133768,back:167225772,front:2546469060,"