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 listSep 1, 2026 05:51Victor MerckléVictor MerckléScore: 1,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 05:521,69050,708,546119,672,0002,015,0002,170,880stderr
2Sep 1, 2026 05:521,69050,725,942119,689,0002,007,0002,170,880stderr
3Sep 1, 2026 05:521,69750,919,749120,501,0002,002,0002,170,880stderr
4Sep 1, 2026 05:521,71551,455,007121,567,0001,019,0002,170,880stderr
5Sep 1, 2026 05:521,71651,482,379120,214,0001,026,0002,170,880stderr
6Sep 1, 2026 05:521,71851,543,302121,706,0001,312,0002,170,880stderr
7Sep 1, 2026 05:521,72451,749,408121,554,0001,029,0002,170,880stderr
8Sep 1, 2026 05:521,73652,102,450122,023,0001,028,0002,170,880stderr
9Sep 1, 2026 05:521,74352,294,312122,217,0001,030,0002,170,880stderr