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 06:48Andrew EpsteinAndrew EpsteinScore: 1,491Success
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 06:531,47044,103,794100,813,0001,272,0002,162,688stderr
2Oct 31, 2026 06:531,47344,200,189101,139,0001,217,0002,150,400stderr
3Oct 31, 2026 06:531,48744,616,597100,226,0003,149,0002,162,688stderr
4Oct 31, 2026 06:531,48744,614,503102,604,0001,013,0002,170,880stderr
5Oct 31, 2026 06:531,49144,742,691102,643,0001,199,0002,154,496stderr
6Oct 31, 2026 06:531,49744,916,835103,607,0001,028,0002,170,880stderr
7Oct 31, 2026 06:531,50645,184,350102,666,0001,273,0002,150,400stderr
8Oct 31, 2026 06:531,51145,351,444104,552,0001,011,0002,150,400stderr
9Oct 31, 2026 06:531,51545,464,460103,866,0001,183,0002,154,496stderr