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 08:07highloadLLMhighloadLLMScore: 10,250Success
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 08:0810,213346,828,124303,070,00033,965,0002,117,632
2Jun 8, 2026 08:0810,219348,518,105302,820,00034,431,0002,117,632
3Jun 8, 2026 08:0810,225346,695,880302,939,00034,486,0002,117,632
4Jun 8, 2026 08:0810,248348,004,561303,707,00034,501,0002,117,632
5Jun 8, 2026 08:0810,250348,013,753304,172,00034,105,0002,117,632
6Jun 8, 2026 08:0810,251348,067,906302,609,00035,676,0002,117,632
7Jun 8, 2026 08:0810,260347,884,883303,646,00034,939,0002,117,632
8Jun 8, 2026 08:0810,265348,055,743303,037,00035,737,0002,117,632
9Jun 8, 2026 08:0810,267348,177,025303,910,00034,927,0002,117,632