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:58Andrew EpsteinAndrew EpsteinScore: 1,501Success
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 04:021,49144,734,496102,829,0001,176,0002,166,784
2Oct 31, 2026 04:021,49244,767,365102,998,0001,114,0002,158,592
3Oct 31, 2026 04:021,49644,902,358103,312,0001,154,0002,166,784
4Oct 31, 2026 04:021,49844,956,862103,188,0001,175,0002,166,784
5Oct 31, 2026 04:021,50145,030,062103,750,0001,189,0002,166,784
6Oct 31, 2026 04:021,51045,301,420104,926,0001,188,0002,166,784
7Oct 31, 2026 04:021,51345,392,679104,612,0001,221,0002,166,784
8Oct 31, 2026 04:021,52045,621,767105,814,0001,076,0002,166,784
9Oct 31, 2026 04:021,91257,389,624113,054,0001,168,0002,166,784