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 31, 2026 13:22Victor MerckléVictor MerckléScore: 1,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 13:231,72451,738,055123,592,0001,014,0002,170,880stderr
2Aug 31, 2026 13:231,72751,833,464122,978,0001,019,0002,170,880stderr
3Aug 31, 2026 13:231,73151,933,433123,875,0002,006,0002,170,880stderr
4Aug 31, 2026 13:231,73852,142,044124,807,0002,000,0002,170,880stderr
5Aug 31, 2026 13:231,74652,391,321123,155,0001,020,0002,170,880stderr
6Aug 31, 2026 13:231,74652,383,632122,841,0001,029,0002,170,880stderr
7Aug 31, 2026 13:231,75352,615,552123,806,0001,023,0002,170,880stderr
8Aug 31, 2026 13:231,75652,698,437123,890,0001,027,0002,170,880stderr
9Aug 31, 2026 13:231,76052,827,534123,256,0001,029,0002,170,880stderr