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:48highload-churnerhighload-churnerScore: 7,959Success
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:497,911270,331,395254,883,0006,195,00020,480
2Oct 12, 2026 14:497,914270,974,203255,051,0006,117,00020,480
3Oct 12, 2026 14:497,918270,983,532255,227,0006,099,00020,480
4Oct 12, 2026 14:497,922270,326,031255,360,0006,086,00020,480
5Oct 12, 2026 14:497,959271,663,717256,503,0006,171,00020,480
6Oct 12, 2026 14:497,960271,559,794256,603,0006,087,00020,480
7Oct 12, 2026 14:497,970271,957,784256,887,0006,147,00020,480
8Oct 12, 2026 14:498,001273,212,520258,024,0006,035,00020,480
9Oct 12, 2026 14:498,172278,786,244263,593,0006,086,00020,480