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 listJun 26, 2026 03:28Victor MerckléVictor MerckléScore: 2,915Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 03:292,89186,754,111234,816,0001,024,0002,658,304
2Jun 26, 2026 03:292,90387,103,196233,528,0003,112,0002,658,304
3Jun 26, 2026 03:292,90987,282,473233,882,0003,113,0002,658,304
4Jun 26, 2026 03:292,91187,350,578234,500,0003,024,0002,654,208
5Jun 26, 2026 03:292,91587,458,264237,064,0001,023,0002,654,208
6Jun 26, 2026 03:292,92187,638,916235,312,0003,120,0002,654,208
7Jun 26, 2026 03:292,93588,069,212236,476,0003,132,0002,658,304
8Jun 26, 2026 03:292,94088,200,881236,869,0003,088,0002,654,208
9Jun 26, 2026 03:292,99689,885,012237,784,0003,056,0002,658,304