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 listMay 12, 2026 01:38Victor MerckléVictor MerckléScore: 6,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 01:396,640228,189,575180,524,00038,620,0002,113,536
2May 12, 2026 01:396,648226,888,271180,724,00038,690,0002,113,536
3May 12, 2026 01:396,652228,571,408180,824,00038,720,0002,113,536
4May 12, 2026 01:396,653228,779,881181,040,00038,536,0002,113,536
5May 12, 2026 01:396,671230,570,723181,373,00038,801,0002,113,536
6May 12, 2026 01:396,687230,874,134182,968,00037,707,0002,113,536
7May 12, 2026 01:396,687229,694,267181,961,00038,739,0002,113,536
8May 12, 2026 01:396,689228,229,303180,908,00039,848,0002,113,536
9May 12, 2026 01:396,717229,240,595183,121,00038,567,0002,113,536