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 01:21Victor MerckléVictor MerckléScore: 4,513Success
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 01:224,492134,775,812370,250,0003,128,0002,613,248stderr
2Aug 16, 2026 01:224,502135,086,138372,494,0003,124,0002,658,304stderr
3Aug 16, 2026 01:224,507135,212,883370,767,0003,110,0002,654,208stderr
4Aug 16, 2026 01:224,513135,390,307373,055,0003,278,0002,613,248stderr
5Aug 16, 2026 01:224,513135,403,234371,457,0003,158,0002,695,168stderr
6Aug 16, 2026 01:224,521135,655,143370,265,0003,161,0002,695,168stderr
7Aug 16, 2026 01:224,527135,838,726372,784,0003,151,0002,613,248stderr
8Aug 16, 2026 01:224,567137,011,088375,266,0003,133,0002,654,208stderr
9Aug 16, 2026 01:224,568137,043,610375,953,0003,088,0002,695,168stderr