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 listJul 5, 2026 19:21zielajzielajScore: 3,166Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 19:25Victor Mercklé10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 19:233,135111,536,124101,404,0002,055,0002,121,728stderr
2Jul 5, 2026 19:233,144111,810,183101,693,0002,090,0002,121,728stderr
3Jul 5, 2026 19:233,157112,232,967102,104,0002,100,0002,121,728stderr
4Jul 5, 2026 19:233,158112,286,098102,135,0002,100,0002,121,728stderr
5Jul 5, 2026 19:233,166112,517,245102,365,0002,115,0002,121,728stderr
6Jul 5, 2026 19:233,170113,213,570102,501,0002,140,0002,121,728stderr
7Jul 5, 2026 19:233,176113,258,201102,746,0002,085,0002,121,728stderr
8Jul 5, 2026 19:233,179113,372,362102,828,0002,089,0002,121,728stderr
9Jul 5, 2026 19:233,401120,290,193110,087,0002,159,0002,121,728stderr