Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 listAug 18, 2026 04:56Josu San MartinJosu San MartinScore: 4,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 05:014,683140,491,474196,805,0003,217,0002,158,592
2Aug 18, 2026 05:014,690140,712,291196,885,0003,265,0002,158,592
3Aug 18, 2026 05:014,702141,087,105197,364,0003,283,0002,158,592
4Aug 18, 2026 05:014,707141,221,630197,474,0003,280,0002,158,592
5Aug 18, 2026 05:014,710141,301,605197,695,0003,265,0002,158,592
6Aug 18, 2026 05:014,714141,449,746197,453,0003,288,0002,158,592
7Aug 18, 2026 05:014,715141,472,122199,313,0003,296,0002,158,592
8Aug 18, 2026 05:014,717141,525,338198,557,0003,264,0002,158,592
9Aug 18, 2026 05:014,771143,155,697198,411,0003,352,0002,150,400