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 15, 2026 17:16Tomislav TunkovicTomislav TunkovicScore: 3,114Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 17:173,098110,682,405101,226,0001,009,00024,576
2Aug 15, 2026 17:173,105110,941,671101,484,0001,012,00024,576
3Aug 15, 2026 17:173,113111,181,478101,729,0001,007,00024,576
4Aug 15, 2026 17:173,114111,200,650101,762,0001,007,00024,576
5Aug 15, 2026 17:173,114111,298,379101,781,0001,004,00024,576
6Aug 15, 2026 17:173,116111,320,111101,833,0001,008,00024,576
7Aug 15, 2026 17:173,119111,388,901101,925,0001,008,00024,576
8Aug 15, 2026 17:173,122111,451,085102,013,0001,015,00024,576
9Aug 15, 2026 17:173,129111,746,834102,246,0001,011,00024,576