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 31, 2026 14:20CodeReclaimersCodeReclaimersScore: 9,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 14:218,916305,401,924257,079,00037,160,0002,113,536
2Jul 31, 2026 14:218,920305,249,198257,207,00037,172,0002,113,536
3Jul 31, 2026 14:218,949305,698,208258,117,00037,214,0002,113,536
4Jul 31, 2026 14:218,997307,718,804259,760,00037,146,0002,113,536
5Jul 31, 2026 14:219,003307,201,699259,839,00037,275,0002,113,536
6Jul 31, 2026 14:219,008308,069,444259,994,00037,292,0002,113,536
7Jul 31, 2026 14:219,089311,236,830262,198,00037,762,0002,113,536
8Jul 31, 2026 14:219,090310,031,058262,138,00037,847,0002,113,536
9Jul 31, 2026 14:219,097310,443,249262,667,00037,541,0002,113,536