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:37Victor MerckléVictor MerckléScore: 4,697Success
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:404,439133,199,378366,762,0003,013,0002,326,528stderr
2Aug 16, 2026 02:404,440133,227,481366,071,0003,039,0002,260,992stderr
3Aug 16, 2026 02:404,451133,558,732364,082,0003,008,0002,576,384stderr
4Aug 16, 2026 02:404,464133,945,174368,744,0003,076,0002,465,792stderr
5Aug 16, 2026 02:404,697140,931,810389,628,0003,011,0002,543,616stderr
6Aug 16, 2026 02:404,734142,049,301390,911,0003,059,0002,355,200stderr
7Aug 16, 2026 02:404,741142,248,206391,913,0003,058,0002,326,528stderr
8Aug 16, 2026 02:404,772143,171,714393,046,0003,053,0002,560,000stderr
9Aug 16, 2026 02:404,778143,345,845392,364,0003,071,0002,330,624stderr