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 10:04Andrew EpsteinAndrew EpsteinScore: 1,553Success
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 10:101,53946,182,652100,481,0002,165,0002,183,168stderr
2Oct 31, 2026 10:101,54246,271,651102,168,0001,013,0002,179,072stderr
3Oct 31, 2026 10:101,54646,401,463101,072,0002,017,0002,183,168stderr
4Oct 31, 2026 10:101,54846,440,340100,986,0002,058,0002,179,072stderr
5Oct 31, 2026 10:101,55346,602,539101,554,0002,090,0002,183,168stderr
6Oct 31, 2026 10:101,55346,598,529102,798,0001,012,0002,183,168stderr
7Oct 31, 2026 10:101,55746,731,438101,576,0002,045,0002,232,320stderr
8Oct 31, 2026 10:101,59147,730,614100,716,0002,074,0002,183,168stderr
9Oct 31, 2026 10:102,08062,422,706119,688,0002,228,0002,179,072stderr