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 listMar 10, 2026 04:32olliecrowolliecrowScore: 14,337Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 04:3214,268492,333,234462,856,0007,997,0002,322,432
2Mar 10, 2026 04:3214,271492,730,147461,945,0008,998,0002,359,296
3Mar 10, 2026 04:3214,303493,371,688463,985,0007,999,0002,338,816
4Mar 10, 2026 04:3214,309501,304,758464,178,0008,003,0002,465,792
5Mar 10, 2026 04:3214,337495,337,306465,122,0008,002,0002,330,624
6Mar 10, 2026 04:3214,351501,319,577464,607,0008,992,0002,322,432
7Mar 10, 2026 04:3214,381499,336,567464,585,0009,991,0002,277,376
8Mar 10, 2026 04:3214,426501,714,410468,060,0008,001,0002,420,736
9Mar 10, 2026 04:3214,456500,144,196469,050,0008,000,0002,469,888