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 5, 2026 14:18Павел РатмановПавел РатмановScore: 168,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 14:22160,5045,327,389,8595,260,677,00035,970,0002,285,568
2Jan 5, 2026 14:22160,9185,341,890,5265,280,320,00029,973,0002,285,568
3Jan 5, 2026 14:22163,3495,425,379,0055,355,545,00034,970,0002,441,216
4Jan 5, 2026 14:18168,9735,613,236,2455,552,155,00023,966,0002,285,568
5Jan 5, 2026 14:18203,5646,767,048,2076,697,644,00019,969,0002,285,568
6Jan 5, 2026 14:18212,5307,053,024,1286,980,535,00032,955,0002,285,568