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 13, 2026 17:18Tomislav TunkovicTomislav TunkovicScore: 5,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 17:195,674195,516,249182,778,0004,471,0002,121,728stderr
2Aug 13, 2026 17:195,689196,095,909183,454,0004,295,0002,121,728stderr
3Aug 13, 2026 17:195,694196,168,991183,622,0004,295,0002,121,728stderr
4Aug 13, 2026 17:195,697196,342,009183,707,0004,309,0002,121,728stderr
5Aug 13, 2026 17:195,702196,471,497183,708,0004,484,0002,121,728stderr
6Aug 13, 2026 17:195,702196,366,377183,923,0004,253,0002,121,728stderr
7Aug 13, 2026 17:195,883202,343,512189,693,0004,463,0002,121,728stderr
8Aug 13, 2026 17:195,885204,614,271189,952,0004,285,0002,121,728stderr
9Aug 13, 2026 17:195,902203,168,605190,368,0004,428,0002,121,728stderr