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 06:33Andrew EpsteinAndrew EpsteinScore: 1,560Success
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 06:371,55246,576,199102,689,0001,009,0002,179,072stderr
2Oct 31, 2026 06:371,55346,591,714101,445,0002,047,0002,179,072stderr
3Oct 31, 2026 06:371,55546,665,557101,738,0002,044,0002,183,168stderr
4Oct 31, 2026 06:371,55646,700,021103,211,0001,009,0002,183,168stderr
5Oct 31, 2026 06:371,56046,826,445101,920,0002,062,0002,183,168stderr
6Oct 31, 2026 06:371,56847,057,661102,694,0002,109,0002,183,168stderr
7Oct 31, 2026 06:371,57247,183,299102,843,0002,030,0002,179,072stderr
8Oct 31, 2026 06:371,61948,576,689102,793,0002,045,0002,183,168stderr
9Oct 31, 2026 06:372,05861,762,929115,945,0002,218,0002,203,648stderr