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 03:02Andrew EpsteinAndrew EpsteinScore: 1,488Success
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 03:051,47344,216,62499,902,0002,000,0002,166,784
2Oct 31, 2026 03:051,47444,224,442101,234,0001,093,0002,166,784
3Oct 31, 2026 03:051,48044,400,166102,201,0001,077,0002,166,784
4Oct 31, 2026 03:051,48644,601,381102,471,0001,173,0002,166,784
5Oct 31, 2026 03:051,48844,653,238102,242,0001,211,0002,166,784
6Oct 31, 2026 03:051,49044,716,771102,828,0001,212,0002,166,784
7Oct 31, 2026 03:051,49244,768,880102,457,0001,155,0002,166,784
8Oct 31, 2026 03:051,49544,863,624103,228,0001,188,0002,166,784
9Oct 31, 2026 03:051,52245,671,845105,667,0001,087,0002,158,592