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 04:13Andrew EpsteinAndrew EpsteinScore: 2,158Success
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:182,15564,675,413162,166,0001,172,0002,158,592
2Oct 31, 2026 04:182,15764,731,365162,328,0001,141,0002,166,784
3Oct 31, 2026 04:182,15764,731,900162,483,0001,143,0002,166,784
4Oct 31, 2026 04:182,15864,767,510162,331,0001,146,0002,166,784
5Oct 31, 2026 04:182,15864,743,583162,208,0001,159,0002,166,784
6Oct 31, 2026 04:182,15964,778,838162,270,0001,267,0002,166,784
7Oct 31, 2026 04:182,16164,849,910162,367,0001,163,0002,166,784
8Oct 31, 2026 04:182,17365,204,803163,467,0001,219,0002,166,784
9Oct 31, 2026 04:182,18065,425,410164,239,0001,260,0002,166,784