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 02:22Victor MerckléVictor MerckléScore: 4,591Success
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 02:234,580137,419,476378,859,0003,208,0002,695,168stderr
2Aug 16, 2026 02:234,583137,501,038377,889,0003,153,0002,613,248stderr
3Aug 16, 2026 02:234,585137,552,382380,029,0003,179,0002,613,248stderr
4Aug 16, 2026 02:234,591137,749,547379,946,0003,136,0002,654,208stderr
5Aug 16, 2026 02:234,591137,741,023378,635,0003,076,0002,695,168stderr
6Aug 16, 2026 02:234,594137,843,426379,255,0003,182,0002,654,208stderr
7Aug 16, 2026 02:234,620138,607,345382,019,0003,143,0002,654,208stderr
8Aug 16, 2026 02:234,665139,969,400379,647,0003,150,0002,613,248stderr
9Aug 16, 2026 02:234,688140,665,921384,156,0003,234,0002,695,168stderr