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 listJun 8, 2026 03:51anboto1anboto1Score: 7,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 03:527,487257,322,152235,777,00011,319,0002,117,632
2Jun 8, 2026 03:527,496257,100,366236,166,00011,213,0002,117,632
3Jun 8, 2026 03:527,537257,964,970236,783,00011,958,0002,117,632
4Jun 8, 2026 03:527,542258,154,389237,140,00011,766,0002,117,632
5Jun 8, 2026 03:527,543258,643,457237,497,00011,443,0002,117,632
6Jun 8, 2026 03:527,545258,197,206237,030,00011,964,0002,117,632
7Jun 8, 2026 03:527,548258,308,105237,160,00011,937,0002,117,632
8Jun 8, 2026 03:527,581259,504,735238,119,00012,061,0002,117,632
9Jun 8, 2026 03:527,601260,075,524238,843,00011,991,0002,117,632