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 listJan 8, 2026 03:12Josu San MartinJosu San MartinScore: 13,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 03:4813,022460,332,595426,723,0002,998,0002,289,664
2Jan 8, 2026 03:4813,692479,430,974449,824,0001,999,0002,326,528
3Jan 8, 2026 03:1213,696479,016,806448,966,0002,999,0002,289,664
4Jan 8, 2026 03:1213,700481,531,720449,087,0003,000,0002,289,664
5Jan 8, 2026 03:1214,638513,582,529480,044,0003,000,0002,289,664
6Jan 8, 2026 03:4815,878550,038,455520,960,0002,999,0002,351,104