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 6, 2026 00:43olliecrowolliecrowScore: 14,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 00:3914,392496,806,617466,943,0007,999,0002,322,432
2Mar 6, 2026 00:4314,430498,612,995468,199,0008,003,0002,326,528
3Mar 6, 2026 00:3914,442501,594,702467,602,0008,992,0002,326,528
4Mar 6, 2026 00:4314,450498,380,264467,841,0008,996,0002,330,624
5Mar 6, 2026 00:3914,456502,085,553469,042,0008,000,0002,531,328
6Mar 6, 2026 00:4314,472509,700,368468,583,0008,992,0002,322,432