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 02:27Andrew EpsteinAndrew EpsteinScore: 1,541Success
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 02:361,50745,236,435101,137,0001,017,0002,170,880
2Oct 31, 2026 02:361,50845,240,446100,661,0001,032,0002,170,880
3Oct 31, 2026 02:361,53646,083,499102,334,0001,009,0002,170,880
4Oct 31, 2026 02:361,53846,157,161102,731,0001,008,0002,170,880
5Oct 31, 2026 02:361,54146,243,768103,904,0001,008,0002,170,880
6Oct 31, 2026 02:361,57047,106,273105,948,0001,010,0002,170,880
7Oct 31, 2026 02:361,58347,506,560107,796,0001,020,0002,170,880
8Oct 31, 2026 02:361,58647,592,389107,710,0001,010,0002,170,880
9Oct 31, 2026 02:361,62748,824,443106,685,0001,012,0002,170,880