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 listJun 24, 2026 07:22Victor MerckléVictor MerckléScore: 4,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 07:234,843167,805,969122,962,00036,872,0002,113,536
2Jun 24, 2026 07:234,845167,795,584123,130,00036,782,0002,113,536
3Jun 24, 2026 07:234,845167,566,561123,093,00036,823,0002,113,536
4Jun 24, 2026 07:234,857167,898,643123,523,00036,769,0002,113,536
5Jun 24, 2026 07:234,861168,024,931122,604,00037,809,0002,113,536
6Jun 24, 2026 07:234,866168,189,714123,925,00036,656,0002,113,536
7Jun 24, 2026 07:234,875168,645,459122,985,00037,906,0002,113,536
8Jun 24, 2026 07:234,876168,839,482124,126,00036,804,0002,113,536
9Jun 24, 2026 07:234,890169,404,048123,489,00037,895,0002,113,536