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 1, 2026 20:21zielajzielajScore: 3,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 20:193,424137,956,653111,008,0002,000,0002,531,328
2Jan 1, 2026 20:193,511140,155,570114,853,000998,0002,273,280
3Jan 1, 2026 20:213,527143,334,937115,375,0001,003,0002,420,736
4Jan 1, 2026 20:213,532139,792,112114,560,0002,009,0002,273,280
5Jan 1, 2026 20:213,578139,955,266116,073,0002,001,0002,506,752
6Jan 1, 2026 20:193,668145,337,787120,059,0001,000,0002,416,640