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 05:20Andrew EpsteinAndrew EpsteinScore: 1,591Success
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 05:251,56346,913,790101,676,0002,017,0002,174,976stderr
2Oct 31, 2026 05:251,58047,419,300103,251,0002,033,0002,179,072stderr
3Oct 31, 2026 05:251,58447,533,229103,873,0002,003,0002,174,976stderr
4Oct 31, 2026 05:251,58747,638,539103,948,0002,029,0002,174,976stderr
5Oct 31, 2026 05:251,59147,759,557104,382,0002,008,0002,179,072stderr
6Oct 31, 2026 05:251,59247,777,140104,722,0002,028,0002,174,976stderr
7Oct 31, 2026 05:251,59447,825,629105,127,0002,047,0002,174,976stderr
8Oct 31, 2026 05:251,59847,962,564106,696,0001,012,0002,174,976stderr
9Oct 31, 2026 05:251,60248,088,672105,318,0002,036,0002,179,072stderr