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 27, 2026 02:05Victor MerckléVictor MerckléScore: 12,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 02:0612,505420,715,112373,667,00039,012,0002,113,536
2Jun 27, 2026 02:0612,509420,632,102373,020,00039,804,0002,113,536
3Jun 27, 2026 02:0612,512420,480,649372,959,00039,955,0002,113,536
4Jun 27, 2026 02:0612,513421,020,417373,729,00039,220,0002,113,536
5Jun 27, 2026 02:0612,526420,984,471374,453,00038,907,0002,113,536
6Jun 27, 2026 02:0612,565422,607,998374,646,00040,030,0002,113,536
7Jun 27, 2026 02:0612,581422,757,674375,095,00040,081,0002,113,536
8Jun 27, 2026 02:0612,657426,890,555379,849,00037,834,0002,113,536
9Jun 27, 2026 02:0612,734428,407,424381,231,00039,010,0002,113,536