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 listJul 25, 2026 17:32boop34boop34Score: 7,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2026 17:337,023242,659,672228,520,0003,269,0002,113,536
2Jul 25, 2026 17:337,026242,956,861228,908,0002,960,0002,113,536
3Jul 25, 2026 17:337,047243,673,622229,621,0002,940,0002,113,536
4Jul 25, 2026 17:337,071243,248,269229,063,0004,293,0002,113,536
5Jul 25, 2026 17:337,079243,564,523229,478,0004,153,0002,113,536
6Jul 25, 2026 17:337,091243,809,674229,995,0004,023,0002,113,536
7Jul 25, 2026 17:337,091243,881,824229,807,0004,212,0002,113,536
8Jul 25, 2026 17:337,092243,953,904229,711,0004,329,0002,113,536
9Jul 25, 2026 17:337,100244,164,083229,966,0004,365,0002,113,536