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 23, 2026 16:42Victor MerckléVictor MerckléScore: 1,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 16:431,91257,362,209137,640,0002,009,0002,170,880stderr
2Aug 23, 2026 16:431,93357,996,157140,052,0002,034,0002,170,880stderr
3Aug 23, 2026 16:431,93658,102,249139,832,0001,040,0002,170,880stderr
4Aug 23, 2026 16:431,94858,446,573143,297,0002,298,0002,170,880stderr
5Aug 23, 2026 16:431,95558,659,886141,909,0002,017,0002,170,880stderr
6Aug 23, 2026 16:431,96158,836,329144,506,0002,013,0002,170,880stderr
7Aug 23, 2026 16:431,96859,062,951141,321,0001,054,0002,170,880stderr
8Aug 23, 2026 16:431,98359,507,412143,849,0001,042,0002,170,880stderr
9Aug 23, 2026 16:432,00960,292,341147,114,0001,035,0002,170,880stderr