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 13, 2026 06:46highload-churnerhighload-churnerScore: 2,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 06:472,69897,960,34487,866,0001,176,00020,480
2Oct 13, 2026 06:472,70998,368,91588,227,0001,188,00020,480
3Oct 13, 2026 06:472,71398,434,70988,532,0001,009,00020,480
4Oct 13, 2026 06:472,71498,434,74488,407,0001,168,00020,480
5Oct 13, 2026 06:472,72098,622,15488,619,0001,172,00020,480
6Oct 13, 2026 06:472,72398,786,83488,660,0001,223,00020,480
7Oct 13, 2026 06:472,73298,985,74588,983,0001,176,00020,480
8Oct 13, 2026 06:472,74599,591,62089,429,0001,178,00020,480
9Oct 13, 2026 06:472,74799,551,64989,483,0001,179,00020,480