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 04:05highload-churnerhighload-churnerScore: 4,199Success
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 04:064,181147,612,196136,667,0001,318,0002,117,632
2Oct 13, 2026 04:064,189147,181,474136,989,0001,261,0002,117,632
3Oct 13, 2026 04:064,195147,354,201137,144,0001,317,0002,117,632
4Oct 13, 2026 04:064,197147,458,788137,442,0001,059,0002,117,632
5Oct 13, 2026 04:064,199147,569,838137,323,0001,255,0002,117,632
6Oct 13, 2026 04:064,218148,269,202137,925,0001,269,0002,117,632
7Oct 13, 2026 04:064,225148,499,075138,106,0001,325,0002,117,632
8Oct 13, 2026 04:064,228148,554,760138,218,0001,319,0002,117,632
9Oct 13, 2026 04:064,405155,477,235144,099,0001,272,0002,117,632