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 12, 2026 14:57highload-churnerhighload-churnerScore: 8,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 14:588,011273,383,019257,267,0007,114,00020,480
2Oct 12, 2026 14:588,025273,673,138257,736,0007,092,00020,480
3Oct 12, 2026 14:588,034274,023,894258,047,0007,075,00020,480
4Oct 12, 2026 14:588,057275,048,512258,862,0007,041,00020,480
5Oct 12, 2026 14:588,059275,022,911258,846,0007,130,00020,480
6Oct 12, 2026 14:588,063275,742,414258,989,0007,103,00020,480
7Oct 12, 2026 14:588,070275,272,123259,160,0007,179,00020,480
8Oct 12, 2026 14:588,224280,214,728264,174,0007,229,00020,480
9Oct 12, 2026 14:588,264281,583,869265,607,0007,114,00020,480