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 20:06anboto1anboto1Score: 14,134Success
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 20:0713,838465,970,987443,858,00012,801,0002,117,632
2Jun 7, 2026 20:0713,937469,311,119447,613,00012,335,0002,117,632
3Jun 7, 2026 20:0713,948469,598,106448,017,00012,286,0002,117,632
4Jun 7, 2026 20:0714,051473,813,515450,464,00013,223,0002,117,632
5Jun 7, 2026 20:0714,134475,739,763453,952,00012,484,0002,117,632
6Jun 7, 2026 20:0714,140475,973,711453,241,00013,386,0002,117,632
7Jun 7, 2026 20:0714,156476,674,061453,615,00013,543,0002,117,632
8Jun 7, 2026 20:0714,159477,071,623454,164,00013,096,0002,117,632
9Jun 7, 2026 20:0714,268480,662,861458,451,00012,420,0002,117,632