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:32Andrew EpsteinAndrew EpsteinScore: 1,580Success
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:371,52145,655,424101,046,0001,050,0002,170,880
2Oct 31, 2026 02:371,54246,266,445101,396,0002,074,0002,162,688
3Oct 31, 2026 02:371,55446,642,488104,085,0001,020,0002,170,880
4Oct 31, 2026 02:371,57547,266,814106,509,0002,065,0002,162,688
5Oct 31, 2026 02:371,58047,401,276101,073,0001,032,0002,170,880
6Oct 31, 2026 02:371,58347,506,356106,462,0002,040,0002,162,688
7Oct 31, 2026 02:372,17265,171,458112,557,0001,010,0002,170,880
8Oct 31, 2026 02:372,21766,528,976114,570,0001,031,0002,170,880
9Oct 31, 2026 02:372,29768,936,674117,635,0002,091,0002,162,688