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 listJun 8, 2026 03:59highloadLLMhighloadLLMScore: 14,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 04:0014,502487,669,281372,434,000106,141,0002,113,536
2Jun 8, 2026 04:0014,509488,080,786373,030,000105,777,0002,113,536
3Jun 8, 2026 04:0014,528488,517,178372,853,000106,579,0002,113,536
4Jun 8, 2026 04:0014,534488,865,006373,222,000106,426,0002,113,536
5Jun 8, 2026 04:0014,554489,525,284372,922,000107,378,0002,113,536
6Jun 8, 2026 04:0014,567490,079,329374,150,000106,563,0002,113,536
7Jun 8, 2026 04:0014,582490,367,440372,884,000108,328,0002,113,536
8Jun 8, 2026 04:0014,600490,980,891374,295,000107,532,0002,113,536
9Jun 8, 2026 04:0014,665493,188,085374,948,000109,023,0002,113,536