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 19:32Victor MerckléVictor MerckléScore: 2,647Success
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 19:332,61878,568,218204,375,0001,215,0002,170,880stderr
2Aug 16, 2026 19:332,62978,874,905203,349,0001,236,0002,170,880stderr
3Aug 16, 2026 19:332,63579,057,101204,235,0001,006,0002,170,880stderr
4Aug 16, 2026 19:332,63679,090,322202,850,0001,208,0002,170,880stderr
5Aug 16, 2026 19:332,64779,413,522204,572,0001,216,0002,170,880stderr
6Aug 16, 2026 19:332,64779,418,192204,801,0001,232,0002,170,880stderr
7Aug 16, 2026 19:332,65279,572,237205,721,0001,212,0002,170,880stderr
8Aug 16, 2026 19:332,65279,570,307203,932,0001,031,0002,170,880stderr
9Aug 16, 2026 19:332,66680,004,871205,238,0001,242,0002,170,880stderr