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 04:34Andrew EpsteinAndrew EpsteinScore: 1,608Success
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 04:421,57747,337,082103,408,0002,040,0002,170,880
2Oct 31, 2026 04:421,58347,514,880103,289,0002,073,0002,174,976
3Oct 31, 2026 04:421,58847,655,285103,792,0002,047,0002,174,976
4Oct 31, 2026 04:421,59247,781,649104,220,0002,032,0002,174,976
5Oct 31, 2026 04:421,60848,240,246105,852,0002,085,0002,174,976
6Oct 31, 2026 04:421,61148,339,161105,695,0002,113,0002,174,976
7Oct 31, 2026 04:421,61948,574,296106,939,0002,069,0002,174,976
8Oct 31, 2026 04:421,62748,815,107107,281,0002,054,0002,220,032
9Oct 31, 2026 04:421,68550,561,750108,161,0002,058,0002,170,880