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 03:30highload-churnerhighload-churnerScore: 5,439Success
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 03:315,394186,907,934176,693,0001,311,0002,117,632
2Oct 13, 2026 03:315,398187,132,899176,811,0001,323,0002,117,632
3Oct 13, 2026 03:315,419187,861,738177,584,0001,243,0002,117,632
4Oct 13, 2026 03:315,428188,157,475177,845,0001,307,0002,117,632
5Oct 13, 2026 03:315,439188,603,919178,259,0001,259,0002,117,632
6Oct 13, 2026 03:315,442188,600,975178,286,0001,329,0002,117,632
7Oct 13, 2026 03:315,444188,666,584178,332,0001,323,0002,117,632
8Oct 13, 2026 03:315,448188,767,823178,484,0001,302,0002,117,632
9Oct 13, 2026 03:315,511190,893,489180,641,0001,238,0002,117,632