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 22, 2026 07:13olliecrowolliecrowScore: 9,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 07:139,852347,220,138322,107,0003,001,0002,482,176
2Mar 22, 2026 07:139,880350,444,454320,031,0006,000,0002,482,176
3Mar 22, 2026 07:139,885348,404,973321,204,0005,003,0002,322,432
4Mar 22, 2026 07:139,889355,757,657321,329,0005,005,0002,314,240
5Mar 22, 2026 07:139,889350,316,760321,335,0005,005,0002,318,336
6Mar 22, 2026 07:139,892348,747,352325,448,000998,0002,322,432
7Mar 22, 2026 07:139,904348,745,730320,827,0005,996,0002,473,984
8Mar 22, 2026 07:139,941351,297,041325,050,0003,000,0002,478,080
9Mar 22, 2026 07:1310,049350,286,512330,624,000998,0002,347,008