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 07:05Andrew EpsteinAndrew EpsteinScore: 3,232Success
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 07:063,19795,938,710255,686,0001,003,0002,379,776stderr
2Oct 31, 2026 07:063,20296,086,281256,838,0001,006,0002,359,296stderr
3Oct 31, 2026 07:063,20996,285,532254,474,0001,005,0002,375,680stderr
4Oct 31, 2026 07:063,21996,570,166257,103,0002,038,0002,265,088stderr
5Oct 31, 2026 07:063,23296,986,971258,335,0001,009,0002,379,776stderr
6Oct 31, 2026 07:063,24797,428,080260,609,0001,003,0002,367,488stderr
7Oct 31, 2026 07:063,24997,497,981258,407,0003,246,0002,392,064stderr
8Oct 31, 2026 07:063,27098,116,606260,112,0003,285,0002,260,992stderr
9Oct 31, 2026 07:063,27198,133,545258,713,0001,030,0002,371,584stderr