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 20, 2026 13:09Victor MerckléVictor MerckléScore: 6,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 13:106,584224,770,799179,751,00037,533,0002,113,536
2Jun 20, 2026 13:106,588225,433,960179,908,00037,528,0002,113,536
3Jun 20, 2026 13:106,591224,948,049180,081,00037,451,0002,113,536
4Jun 20, 2026 13:106,593225,256,294179,915,00037,680,0002,113,536
5Jun 20, 2026 13:106,593225,095,997180,043,00037,557,0002,113,536
6Jun 20, 2026 13:106,623226,125,972181,051,00037,510,0002,113,536
7Jun 20, 2026 13:106,623226,008,017180,292,00038,295,0002,113,536
8Jun 20, 2026 13:106,627226,348,198180,435,00038,287,0002,113,536
9Jun 20, 2026 13:106,678229,322,635182,989,00037,402,0002,113,536