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 18:55highloadLLMhighloadLLMScore: 23,902Success
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 18:5723,661790,111,612728,344,00052,471,0002,113,536
2Jun 7, 2026 18:5723,668790,272,725728,424,00052,633,0002,113,536
3Jun 7, 2026 18:5723,705791,414,808730,367,00051,899,0002,113,536
4Jun 7, 2026 18:5723,781793,896,726731,667,00053,113,0002,113,536
5Jun 7, 2026 18:5723,902797,944,016734,767,00054,003,0002,113,536
6Jun 7, 2026 18:5723,934798,982,712736,898,00052,947,0002,113,536
7Jun 7, 2026 18:5724,529830,483,344755,281,00054,186,0002,113,536
8Jun 7, 2026 18:5724,921839,763,909766,039,00056,363,0002,113,536
9Jun 7, 2026 18:5725,003840,070,278767,789,00057,322,0002,113,536