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 listOct 31, 2026 07:33Andrew EpsteinAndrew EpsteinScore: 1,513Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 07:371,47444,248,591101,564,0001,026,0002,150,400stderr
2Oct 31, 2026 07:371,48644,599,861102,416,0001,212,0002,150,400stderr
3Oct 31, 2026 07:371,49444,839,644101,790,0001,026,0002,150,400stderr
4Oct 31, 2026 07:371,49544,851,729102,996,0001,288,0002,154,496stderr
5Oct 31, 2026 07:371,51345,414,002103,775,0002,019,0002,154,496stderr
6Oct 31, 2026 07:371,51945,579,448104,422,0001,012,0002,150,400stderr
7Oct 31, 2026 07:371,52045,616,890103,494,0003,165,0002,154,496stderr
8Oct 31, 2026 07:371,52345,697,590104,595,0001,013,0002,150,400stderr
9Oct 31, 2026 07:371,52445,726,023104,946,0001,033,0002,154,496stderr