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 listOct 9, 2026 10:48highload-churnerhighload-churnerScore: 17,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 10:5417,833598,979,785577,714,00010,795,00020,480
2Oct 9, 2026 10:5417,845599,355,043578,167,00010,737,00020,480
3Oct 9, 2026 10:5417,866601,447,775578,803,00010,777,00020,480
4Oct 9, 2026 10:5417,883600,569,660579,544,00010,602,00020,480
5Oct 9, 2026 10:5417,899601,160,683579,928,00010,750,00020,480
6Oct 9, 2026 10:5417,902601,164,132580,192,00010,601,00020,480
7Oct 9, 2026 10:5417,919601,859,665580,539,00010,789,00024,576
8Oct 9, 2026 10:5417,974603,680,401582,408,00010,760,00020,480
9Oct 9, 2026 10:5418,244612,509,869591,458,00010,608,00020,480