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 listSep 1, 2026 08:07Victor MerckléVictor MerckléScore: 4,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 08:084,578137,358,654379,362,0002,005,0002,170,880stderr
2Sep 1, 2026 08:084,585137,564,553379,123,0001,034,0002,170,880stderr
3Sep 1, 2026 08:084,589137,690,105380,983,0002,021,0002,170,880stderr
4Sep 1, 2026 08:084,592137,786,359379,363,0001,011,0002,170,880stderr
5Sep 1, 2026 08:084,606138,185,354379,984,0002,035,0002,170,880stderr
6Sep 1, 2026 08:084,608138,256,343381,216,0002,020,0002,170,880stderr
7Sep 1, 2026 08:084,640139,203,968383,820,0001,032,0002,170,880stderr
8Sep 1, 2026 08:084,644139,337,018382,850,0001,023,0002,170,880stderr
9Sep 1, 2026 08:084,666139,994,342386,065,0002,030,0002,170,880stderr