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 02:47highload-churnerhighload-churnerScore: 9,532Success
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 02:489,487321,934,269270,243,00042,852,00024,576
2Oct 12, 2026 02:489,491322,323,233269,408,00043,826,00024,576
3Oct 12, 2026 02:489,504322,806,480271,629,00042,016,00024,576
4Oct 12, 2026 02:489,527323,406,006271,323,00043,069,00024,576
5Oct 12, 2026 02:489,532323,613,228271,611,00042,957,00024,576
6Oct 12, 2026 02:489,553324,225,508272,364,00042,888,00024,576
7Oct 12, 2026 02:489,560325,961,832270,540,00044,956,00024,576
8Oct 12, 2026 02:489,654327,609,532274,710,00043,896,00024,576
9Oct 12, 2026 02:489,693330,988,760277,418,00042,458,00024,576