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 05:23Victor MerckléVictor MerckléScore: 4,977Success
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 05:244,959171,197,293126,709,00036,946,0002,113,536
2Jun 24, 2026 05:244,965171,657,639127,136,00036,712,0002,113,536
3Jun 24, 2026 05:244,972171,756,969127,346,00036,761,0002,113,536
4Jun 24, 2026 05:244,974172,054,855127,480,00036,675,0002,113,536
5Jun 24, 2026 05:244,977172,004,920127,412,00036,832,0002,113,536
6Jun 24, 2026 05:244,987172,443,151126,911,00037,671,0002,113,536
7Jun 24, 2026 05:244,990172,376,350127,781,00036,921,0002,113,536
8Jun 24, 2026 05:245,000173,022,243128,303,00036,729,0002,113,536
9Jun 24, 2026 05:245,008172,811,380127,621,00037,643,0002,113,536