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 listMar 16, 2026 16:13Dominique GarmierDominique GarmierScore: 30,940Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 16:1330,3641,025,687,098988,997,00012,999,0002,355,200
2Mar 16, 2026 16:1330,9401,052,694,8641,014,030,0006,993,0002,375,680
3Mar 16, 2026 16:1331,2971,058,085,9111,024,816,0007,998,0002,371,584