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 listAug 17, 2026 04:31marko1597marko1597Score: 8,915Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 04:578,840300,042,838279,980,00011,753,0002,121,728stderr
2Aug 17, 2026 04:578,890301,657,232281,389,00011,988,0002,121,728stderr
3Aug 17, 2026 04:578,897301,909,416281,928,00011,702,0002,121,728stderr
4Aug 17, 2026 04:578,904302,045,775282,213,00011,637,0002,121,728stderr
5Aug 17, 2026 04:578,915302,506,609282,189,00012,010,0002,121,728stderr
6Aug 17, 2026 04:578,926302,819,559282,536,00012,036,0002,121,728stderr
7Aug 17, 2026 04:578,934303,924,907282,915,00011,912,0002,121,728stderr
8Aug 17, 2026 04:578,939303,295,384282,900,00012,103,0002,121,728stderr
9Aug 17, 2026 04:578,944303,481,028283,133,00012,046,0002,121,728stderr