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 4, 2026 15:42Victor MerckléVictor MerckléScore: 1,730Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 15:561,69150,753,986119,612,0001,025,0002,170,880stderr
2Sep 4, 2026 15:561,69550,864,490120,271,0002,029,0002,170,880stderr
3Sep 4, 2026 15:561,69950,983,103120,098,0002,013,0002,170,880stderr
4Sep 4, 2026 15:561,70151,036,446121,229,0002,026,0002,170,880stderr
5Sep 4, 2026 15:561,73051,914,969122,416,0001,027,0002,170,880stderr
6Sep 4, 2026 15:561,73352,005,348121,935,0002,025,0002,170,880stderr
7Sep 4, 2026 15:561,74252,264,045120,272,0001,030,0002,170,880stderr
8Sep 4, 2026 15:561,74652,382,318122,000,0001,031,0002,170,880stderr
9Sep 4, 2026 15:561,75352,604,439121,455,0001,030,0002,170,880stderr