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 7, 2026 22:45anboto1anboto1Score: 11,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 22:4911,564391,306,992369,392,00012,252,0002,117,632
2Jun 7, 2026 22:4911,577391,891,475370,191,00011,880,0002,117,632
3Jun 7, 2026 22:4911,610392,448,168370,638,00012,506,0002,117,632
4Jun 7, 2026 22:4911,646393,616,170371,777,00012,566,0002,117,632
5Jun 7, 2026 22:4911,647393,626,905371,988,00012,381,0002,117,632
6Jun 7, 2026 22:4911,682394,801,926372,878,00012,637,0002,117,632
7Jun 7, 2026 22:4911,718395,978,419374,137,00012,578,0002,117,632
8Jun 7, 2026 22:4911,756397,277,725375,220,00012,742,0002,117,632
9Jun 7, 2026 22:4911,841400,047,204378,043,00012,727,0002,117,632