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:44highload-churnerhighload-churnerScore: 3,658Success
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:443,643129,186,275119,185,0001,048,00020,480
2Oct 13, 2026 04:443,651130,098,108119,182,0001,313,00020,480
3Oct 13, 2026 04:443,655129,651,680119,390,0001,247,00020,480
4Oct 13, 2026 04:443,656129,562,404119,593,0001,060,00020,480
5Oct 13, 2026 04:443,658129,548,323119,394,0001,324,00020,480
6Oct 13, 2026 04:443,665129,763,684119,670,0001,301,00020,480
7Oct 13, 2026 04:443,683130,446,308120,227,0001,333,00020,480
8Oct 13, 2026 04:443,704131,249,335120,899,0001,341,00020,480
9Oct 13, 2026 04:443,710131,331,239121,119,0001,326,00020,480