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 24, 2026 03:59Victor MerckléVictor MerckléScore: 3,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 04:003,412102,383,063270,400,0003,111,0002,658,304stderr
2Jun 24, 2026 04:003,428102,868,243269,794,0003,125,0002,658,304stderr
3Jun 24, 2026 04:003,430102,911,661271,024,0003,136,0002,658,304stderr
4Jun 24, 2026 04:003,433103,003,673269,894,0003,144,0002,658,304stderr
5Jun 24, 2026 04:003,435103,069,702271,396,0003,106,0002,658,304stderr
6Jun 24, 2026 04:003,467104,025,663272,134,0003,086,0002,658,304stderr
7Jun 24, 2026 04:003,475104,277,262271,751,0003,104,0002,658,304stderr
8Jun 24, 2026 04:003,496104,891,973272,571,0003,097,0002,658,304stderr
9Jun 24, 2026 04:003,529105,876,300274,922,0003,071,0002,658,304stderr