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 listJun 8, 2026 02:18highloadLLMhighloadLLMScore: 15,002Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 02:2014,948502,500,951381,133,000112,182,0002,113,536
2Jun 8, 2026 02:2014,963503,022,185381,269,000112,537,0002,113,536
3Jun 8, 2026 02:2014,972503,393,768381,411,000112,687,0002,113,536
4Jun 8, 2026 02:2014,997504,161,681381,486,000113,443,0002,113,536
5Jun 8, 2026 02:2015,002504,201,045381,420,000113,671,0002,113,536
6Jun 8, 2026 02:2015,005504,881,418382,128,000113,060,0002,113,536
7Jun 8, 2026 02:2015,025505,015,779382,024,000113,818,0002,113,536
8Jun 8, 2026 02:2015,026507,461,524382,270,000113,601,0002,113,536
9Jun 8, 2026 02:2015,035505,397,913382,198,000113,978,0002,113,536