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 listJul 1, 2026 17:27Victor MerckléVictor MerckléScore: 3,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 17:283,886136,050,114127,115,0001,133,0002,117,632stderr
2Jul 1, 2026 17:283,888136,094,223127,185,0001,138,0002,117,632stderr
3Jul 1, 2026 17:283,890136,118,264127,250,0001,147,0002,117,632stderr
4Jul 1, 2026 17:283,891136,265,300127,265,0001,146,0002,117,632stderr
5Jul 1, 2026 17:283,895136,832,862127,385,0001,172,0002,117,632stderr
6Jul 1, 2026 17:283,902136,542,425127,620,0001,167,0002,117,632stderr
7Jul 1, 2026 17:283,907136,709,536127,756,0001,177,0002,117,632stderr
8Jul 1, 2026 17:283,907136,659,123127,799,0001,164,0002,117,632stderr
9Jul 1, 2026 17:283,922137,873,852127,274,0002,178,0002,117,632stderr