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 16, 2026 21:35Victor MerckléVictor MerckléScore: 2,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 21:362,94488,348,726233,726,0001,139,0002,641,920stderr
2Aug 16, 2026 21:362,95988,796,564233,877,0001,207,0002,695,168stderr
3Aug 16, 2026 21:362,96889,052,376234,120,0001,140,0002,695,168stderr
4Aug 16, 2026 21:362,98189,443,288233,172,0001,153,0002,641,920stderr
5Aug 16, 2026 21:362,98289,470,621235,173,0001,134,0002,691,072stderr
6Aug 16, 2026 21:362,99389,807,269235,308,0001,170,0002,691,072stderr
7Aug 16, 2026 21:363,20296,070,388232,552,0002,148,0002,654,208stderr
8Aug 16, 2026 21:363,24297,272,832235,130,0001,179,0002,670,592stderr
9Aug 16, 2026 21:364,317129,533,735233,055,0001,236,0002,666,496stderr