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 listJul 8, 2026 12:51Victor MerckléVictor MerckléScore: 3,056Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 12:553,00290,075,150231,688,0003,380,0002,674,688
2Jul 8, 2026 12:553,01690,499,779232,528,0003,407,0002,678,784
3Jul 8, 2026 12:553,02290,668,125232,005,0003,714,0002,670,592
4Jul 8, 2026 12:553,02990,894,142233,310,0003,499,0002,674,688
5Jul 8, 2026 12:553,05691,685,172236,798,0003,742,0002,437,120
6Jul 8, 2026 12:553,06892,052,223236,883,0003,357,0002,674,688
7Jul 8, 2026 12:553,07492,246,924238,558,0003,206,0002,678,784
8Jul 8, 2026 12:553,07892,364,854237,454,0003,434,0002,678,784
9Jul 8, 2026 12:553,09292,768,267238,638,0003,180,0002,674,688