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 listJan 10, 2026 21:51zielajzielajScore: 3,169Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 20:563,101128,156,257100,311,0002,006,0002,412,544
2Jan 10, 2026 20:563,109134,619,545101,604,0001,005,0002,535,424
3Jan 10, 2026 21:513,153125,229,522103,057,0001,000,0002,535,424
4Jan 10, 2026 20:563,163126,597,599102,372,0002,007,0002,416,640
5Jan 10, 2026 20:573,169133,096,052101,566,0003,016,0002,416,640
6Jan 10, 2026 20:573,169133,629,925103,577,0001,005,0002,310,144
7Jan 10, 2026 21:513,175133,284,339102,781,0001,995,0002,310,144
8Jan 10, 2026 21:513,180126,134,659101,955,0002,998,0002,412,544
9Jan 10, 2026 20:573,267131,611,547105,802,0001,996,0002,408,448