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 06:46Victor MerckléVictor MerckléScore: 4,939Success
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 06:474,919169,891,991125,539,00036,810,0002,113,536
2Jun 24, 2026 06:474,930170,183,190125,085,00037,635,0002,113,536
3Jun 24, 2026 06:474,931170,446,753125,135,00037,616,0002,113,536
4Jun 24, 2026 06:474,935170,956,708125,984,00036,878,0002,113,536
5Jun 24, 2026 06:474,939171,116,775126,093,00036,896,0002,113,536
6Jun 24, 2026 06:474,942170,831,090125,295,00037,807,0002,113,536
7Jun 24, 2026 06:474,946170,889,834125,586,00037,660,0002,113,536
8Jun 24, 2026 06:474,946170,709,533125,623,00037,597,0002,113,536
9Jun 24, 2026 06:474,957171,076,740125,863,00037,737,0002,113,536