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 23:19anboto1anboto1Score: 11,116Success
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 23:2310,977371,572,205349,674,00012,579,0002,117,632
2Jun 7, 2026 23:2311,015372,849,881351,503,00011,998,0002,117,632
3Jun 7, 2026 23:2311,065374,435,302353,186,00011,962,0002,117,632
4Jun 7, 2026 23:2311,067374,518,293352,568,00012,661,0002,117,632
5Jun 7, 2026 23:2311,116376,550,382354,706,00012,126,0002,117,632
6Jun 7, 2026 23:2311,128376,539,876355,165,00012,079,0002,117,632
7Jun 7, 2026 23:2311,152377,403,214355,906,00012,112,0002,117,632
8Jun 7, 2026 23:2311,241380,733,948358,869,00012,087,0002,117,632
9Jun 7, 2026 23:2311,254381,112,841359,336,00012,065,0002,117,632