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 23, 2026 07:31Matthias GörgensMatthias GörgensScore: 6,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 07:326,261187,853,180175,985,0001,141,0002,129,920
2Sep 23, 2026 07:326,313189,399,694177,518,0001,140,0002,134,016
3Sep 23, 2026 07:326,332189,988,757178,130,0001,133,0002,129,920
4Sep 23, 2026 07:326,336190,091,163178,183,0001,132,0002,129,920
5Sep 23, 2026 07:326,340190,209,999178,288,0001,137,0002,129,920
6Sep 23, 2026 07:326,362190,888,027178,908,0001,142,0002,129,920
7Sep 23, 2026 07:326,377191,334,511179,088,0001,179,0002,129,920
8Sep 23, 2026 07:326,378191,341,688177,797,0002,037,0002,129,920
9Sep 23, 2026 07:326,378191,341,043178,257,0001,136,0002,129,920