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 7, 2026 23:35highloadLLMhighloadLLMScore: 18,006Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 23:3617,683592,819,251544,628,00038,917,0002,113,536
2Jun 7, 2026 23:3617,733594,895,532546,718,00038,487,0002,113,536
3Jun 7, 2026 23:3617,851598,620,098551,166,00037,945,0002,113,536
4Jun 7, 2026 23:3617,979602,510,410554,523,00038,792,0002,113,536
5Jun 7, 2026 23:3618,006603,409,326555,917,00038,313,0002,113,536
6Jun 7, 2026 23:3618,010603,630,523555,326,00039,014,0002,113,536
7Jun 7, 2026 23:3618,077605,626,268557,264,00039,294,0002,113,536
8Jun 7, 2026 23:3618,188609,465,214562,059,00038,174,0002,113,536
9Jun 7, 2026 23:3618,211611,970,163563,043,00037,947,0002,113,536