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 19, 2026 02:54highload-churnerhighload-churnerScore: 1,490Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 02:551,48144,446,830103,248,0000364,544stderr
2Oct 19, 2026 02:551,48344,515,185103,448,0000364,544stderr
3Oct 19, 2026 02:551,48844,648,684103,149,0001,031,000344,064stderr
4Oct 19, 2026 02:551,48844,654,057103,895,0000364,544stderr
5Oct 19, 2026 02:551,49044,723,542103,023,0001,027,000344,064stderr
6Oct 19, 2026 02:551,49144,738,941103,114,0001,023,000344,064stderr
7Oct 19, 2026 02:551,49944,976,093102,643,0001,014,000385,024stderr
8Oct 19, 2026 02:551,51845,541,154106,445,0000360,448stderr
9Oct 19, 2026 02:552,00960,281,390118,507,0002,151,000344,064stderr