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 listJan 10, 2026 22:07zielajzielajScore: 3,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 22:083,104125,143,167100,412,0002,008,0002,498,560
2Jan 10, 2026 22:083,116127,376,62499,842,0002,995,0002,404,352
3Jan 10, 2026 20:043,127126,403,556102,201,0001,001,0002,273,280
4Jan 10, 2026 22:073,133130,590,505102,385,0001,003,0002,408,448
5Jan 10, 2026 22:083,137132,543,035101,517,0002,010,0002,404,352
6Jan 10, 2026 20:043,168131,943,319104,529,00002,404,352
7Jan 10, 2026 22:073,169127,503,871103,581,0001,005,0002,502,656
8Jan 10, 2026 22:073,224135,860,222105,385,0001,003,0002,396,160
9Jan 10, 2026 20:043,261138,039,878106,617,0001,005,0002,400,256