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 11:12Tomislav TunkovicTomislav TunkovicScore: 3,274Success
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 11:173,249117,160,678106,206,0001,015,00024,576
2Aug 17, 2026 11:173,249117,154,095106,221,0001,003,00024,576
3Aug 17, 2026 11:173,264117,608,629106,693,0001,038,00024,576
4Aug 17, 2026 11:173,267119,123,049106,783,0001,034,00024,576
5Aug 17, 2026 11:173,274117,909,213107,033,0001,030,00024,576
6Aug 17, 2026 11:173,279118,095,170107,217,0001,015,00024,576
7Aug 17, 2026 11:173,289118,481,130107,524,0001,033,00024,576
8Aug 17, 2026 11:173,301118,951,622107,944,0001,010,00024,576
9Aug 17, 2026 11:173,324119,622,165108,700,0001,020,00024,576