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,515Success
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:031,48244,484,985101,567,0001,246,0002,166,784
2Oct 31, 2026 04:031,50245,075,903103,818,0001,111,0002,166,784
3Oct 31, 2026 04:031,50445,147,273104,357,0001,086,0002,166,784
4Oct 31, 2026 04:031,51445,443,642105,221,0001,044,0002,158,592
5Oct 31, 2026 04:031,51545,465,439104,767,0001,082,0002,166,784
6Oct 31, 2026 04:031,52945,888,307106,561,0001,165,0002,166,784
7Oct 31, 2026 04:031,79853,960,931114,107,0002,991,0002,158,592
8Oct 31, 2026 04:031,80654,186,847113,508,0002,053,0002,166,784
9Oct 31, 2026 04:031,82354,705,188119,856,0001,265,0002,166,784