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:11Andrew EpsteinAndrew EpsteinScore: 1,504Success
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:131,44843,451,83698,910,0001,209,0002,150,400stderr
2Oct 31, 2026 07:131,44943,494,68199,113,0001,135,0002,154,496stderr
3Oct 31, 2026 07:131,49144,752,986102,666,0001,211,0002,154,496stderr
4Oct 31, 2026 07:131,49244,779,699102,171,0001,212,0002,154,496stderr
5Oct 31, 2026 07:131,50445,127,966102,546,0001,295,0002,150,400stderr
6Oct 31, 2026 07:131,50845,248,323104,615,0001,019,0002,150,400stderr
7Oct 31, 2026 07:131,51045,309,085103,283,0001,017,0002,154,496stderr
8Oct 31, 2026 07:131,52245,664,063101,776,0003,132,0002,150,400stderr
9Oct 31, 2026 07:131,53646,081,675105,809,0001,031,0002,150,400stderr