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 09:10Andrew EpsteinAndrew EpsteinScore: 1,568Success
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 09:161,55346,603,463101,673,0002,020,0002,183,168stderr
2Oct 31, 2026 09:161,55346,603,602102,803,0001,009,0002,183,168stderr
3Oct 31, 2026 09:161,55646,680,672102,828,0001,078,0002,179,072stderr
4Oct 31, 2026 09:161,56046,827,422102,464,0002,022,0002,179,072stderr
5Oct 31, 2026 09:161,56847,051,760102,772,0002,009,0002,183,168stderr
6Oct 31, 2026 09:161,57347,192,824104,697,0001,009,0002,183,168stderr
7Oct 31, 2026 09:161,59247,785,429105,041,0002,010,0002,179,072stderr
8Oct 31, 2026 09:161,60048,005,418106,031,0002,012,0002,179,072stderr
9Oct 31, 2026 09:161,66950,097,288101,880,0002,039,0002,183,168stderr