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 28, 2026 05:38Victor MerckléVictor MerckléScore: 3,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 05:393,443121,443,379112,531,0001,114,0002,113,536
2Jun 28, 2026 05:393,444121,740,245112,502,0001,177,0002,113,536
3Jun 28, 2026 05:393,449121,905,375112,673,0001,176,0002,113,536
4Jun 28, 2026 05:393,449121,807,467112,683,0001,156,0002,113,536
5Jun 28, 2026 05:393,452121,645,876112,768,0001,163,0002,113,536
6Jun 28, 2026 05:393,455121,715,986112,905,0001,111,0002,113,536
7Jun 28, 2026 05:393,459121,845,803113,034,0001,117,0002,113,536
8Jun 28, 2026 05:393,462122,357,327113,089,0001,175,0002,113,536
9Jun 28, 2026 05:393,466122,508,228113,205,0001,183,0002,113,536