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 01:21Victor MerckléVictor MerckléError
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 01:220152,450,792368,713,0003,111,0002,637,824expected "1020185 ", got "1020184 "
2Jun 26, 2026 01:225,038151,147,305367,797,0003,149,0002,637,824
3Jun 26, 2026 01:225,040151,208,493369,437,0002,104,0002,637,824
4Jun 26, 2026 01:225,071152,141,607370,313,0003,179,0002,637,824
5Jun 26, 2026 01:225,084152,522,914372,787,0003,084,0002,637,824
6Jun 26, 2026 01:225,095152,865,143373,780,0003,046,0002,633,728
7Jun 26, 2026 01:225,118153,560,404374,092,0003,145,0002,637,824
8Jun 26, 2026 01:225,119153,595,442372,686,0003,144,0002,412,544
9Jun 26, 2026 01:225,182155,479,303376,596,0002,118,0002,637,824