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 01:46highloadLLMhighloadLLMScore: 17,725Success
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 01:4717,647591,626,448444,480,000137,875,0002,113,536
2Jun 8, 2026 01:4717,652591,762,850445,479,000137,053,0002,113,536
3Jun 8, 2026 01:4717,702593,409,919445,766,000138,417,0002,113,536
4Jun 8, 2026 01:4717,721594,931,121446,332,000138,491,0002,113,536
5Jun 8, 2026 01:4717,725594,053,798446,091,000138,854,0002,113,536
6Jun 8, 2026 01:4717,728594,241,215446,580,000138,467,0002,113,536
7Jun 8, 2026 01:4717,737594,486,398446,975,000138,354,0002,113,536
8Jun 8, 2026 01:4717,770595,661,512444,681,000141,730,0002,113,536
9Jun 8, 2026 01:4717,842598,064,797446,366,000142,448,0002,113,536